small medium large xlarge

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.

  • Typo
  • Tech. error
  • Suggestion
  • Maybe next edition
  • Not a problem
  • 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 diagra...more...
  • 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 diagram...more...
  • 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”...more...
  • 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 sea...more...
  • 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 c...more...
  • 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...more...
  • 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