Errata

Learning Algorithms

Errata for Learning Algorithms

Submit your own errata for this product.

The errata list is a list of errors and their corrections that were found after the product was released.

The following errata were submitted by our customers and have not yet been approved or disproved by the author or editor. They solely represent the opinion of the customer.

Color Key: Serious technical mistake Minor technical mistake Language or formatting error Typo Question Note Update

Version Location Description Submitted by Date submitted
Listing 1-8
Listing 1-8

Listing 1-8 has wrong caption. Should read something like "Two functions to determine whether a string is a palindrome"

 Sarah Grey  Aug 10, 2023 
ePub Page Counting All Bytes, chapter 2
1st para below heading "Counting All Bytes"

"When an algorithm dynamically allocates additional storage space, it invariably -----increases---- ++++decreases++++ the runtime performance because of the costs associated with dynamic memory management."

"increases" should be replaced with "decreases".

 Aman Mehra  Oct 16, 2023 
ePub Page Curve fitting versus lower and upper bounds
3rd paragraph in section

When you have an accurate model, f(N), that reflects the count of the key
operations in the worst case for an algorithm on a problem instance of
size N, then you have classified O(f(N)) in the worst case. This is the
upper bound. A corresponding lower bound can be similarly derived to model
the effort that the algorithm must at least expend in the ????worst case????. The
notation Ω(f(N)) is used to describe the classification of the lower bound
of an algorithm.

Should this ????worst case???? be replaced with ****best case****? Please clarify what you mean by least effort in worst case?

 Anonymous  Oct 17, 2023 
Other Digital Version 215,216
5th paragraph

In the last paragraph it says that with directed graphs many algorithms are simplified when using recursion and shows an example in listing 7-8. However upon checking the code I can't find why that code would not work with an undirected graph since the only thing that you are changing is the use of a stack for recursion and you are still checking each node if it's in marked so you can use it also in an undirected graph unless I'm missing something.

 Roman Martinez  Jan 19, 2022