The latest version of the book is P2.0, released over 1 year ago. If you've bought a PDF of the book and would like to update it to this version (for free), visit your home page.
By default this page displays the errata for the latest version of the book. If you have a previous version, select it here:
If you've found a new error, please submit it.
- Reported in: P2.0 (23-Nov-18)
Paper page: 1-200
Throughout the entire book the diagrams are misprinted, many of the images/characters in the diagrams are displayed as boxes. Correctly printed diagrams are very rare.
A real shame, because apart from this I love this book! Unfortunately this renders the book rather useless....--André Boonzaaijer
- Reported in: P2.0 (10-Sep-18)
Paper page: 10
Print version of book. I'm not sure of the exact version. Bought from Amazon on the 8th September 2018.
Contains numerous characters in the diagrams that are printed as little boxes, where they should be number and letters. Most prominent in the first 2 chapters, and at the end the discount code is also printed a just empty boxes.
I took some pictures - 10, 23, 25 but they mostly don't include the page number.
Would you please send me a PDF version? I'm sending it back but I'd expect this to be a flaw in the print run and not a one off, so it doesn't make sense to ask for a replacement print copy.
I can send you the images if you like.
Andrew --Andrew Lowcock
- Reported in: P2.0 (12-Apr-19)
PDF page: 17
In the “what’s in this book?” Section there is this phrase:
“We unveil Big O Notation and explain it in terms that my grandmother could understand”
I’d suggest to refrain to using this analogy. Even if his grandmother might have a hard time understanding Big O there are very smart grandmothers out there. It’d be great if we could change our view in this industry and be more supportive of women and seniority.
Thanks, love your books!
- Reported in: P2.0 (14-Oct-18)
PDF page: 26
"Let’s see how this plays out for even larger arrays. With an array of 10,000
elements, a linear search can take up to 10,000 steps, while binary search
takes up to a maximum of just thirteen steps."
Shouldn't that be fourteen steps?
2 to the power of 13 is just 8192 and that is less than 10_000.
- Reported in: P2.0 (15-Mar-19)
Paper page: 122
Text says "There right pointer is pointing to the 6 as well, so would theoretically move on to the next cell on the left. However, there are no more cells to the left of the 6, so the right pointer stops moving."
I don't think the pointer stops moving? Nothing in the def partition implementation on page 117 says the right pointer will stop moving and the code there does not check index out of bounds of the array. The whole code was indexing into the same original array, so there are indeed cells to the left of 6, contrary to what the text says. The right pointer should move left 1 more time to point at 3 in the sequence of 012365 and stop because 3 < pivot of 5.
- Reported in: P2.0 (25-Oct-19)
PDF page: 156
Missing the word "search" from the second-half of the following sentence:
"While ordered arrays have O(log N) search and O(N) insertion, binary trees have O(log N) and O(log N) insertion."
I believe it should have been:
"...binary trees have O(log N) search and O(log N) insertion."
- Reported in: P1.0 (29-Sep-19)
PDF page: 172
Quick sort code enters an infinite loop with input [8, 8, 8, 8, 8, 8, 2]--Nikolai Valuev