small medium large xlarge

The latest version of the book is P1.0, released 4 months ago. If you've bought a PDF of the book and would like to upgrade 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: B3.0 (31-May-17)
#81591
PDF page: 1

The last line:

"becuase it can’t handle the load."--Gareth Nicholson

  • Reported in: B3.0 (31-May-17)
#81592
PDF page: 3
"In this chapter, we’ll analyze how fast each of these operations when applied to an array." "are" should be placed after "operations"--Gareth Nic...more...
  • Reported in: B3.0 (31-May-17)
#81593
PDF page: 17

"For example, the process for preparing a bowl of cereal is can be called an algorithm."

"is" needs to be removed.--Gareth Nicholson

  • Reported in: B4.0 (01-Jun-17)
#81602
PDF page: 33
"O(1) is the way to describe any algorithm is that doesn’t change its number of steps even when the data increases" "is" needs to be removed afte...more...
  • Reported in: P1.0 (30-Aug-17)
#81999
PDF page: 40

Step #8: We being by comparing
=>
We begin by comparing--Phillip Davis

  • Reported in: B4.0 (28-Jun-17)
#81745
PDF page: 64
"And indeed - between if given the choice between those two options, Selection Sort is the better choice." should read "And indeed - if given th...more...
  • Reported in: P1.0 (18-Aug-17)
#81971
PDF page: 65
Chapter 6 The image in step 3 is from an example mentioned earlier in the same chapter. Also, there is a mistake in step 12's image regarding the res...more...
  • Reported in: P1.0 (24-Nov-17)
#82298
PDF page: 65
Super minor, it looks like the arrays examples were swapped between topics. On page 65, Insertion Sort in Action, the example array corresponds to t...more...
  • Reported in: P1.0 (30-Aug-17)
#82000
PDF page: 68
In addition to the errors already reported by another reader at step #3 and step #12, at "Insertion Sort in Action" step #18: Correction [1 2 3 4 7]...more...
  • Reported in: B4.0 (05-Jul-17)
#81794
PDF page: 71
Chapter 6 - Page 71 (PDF) Image after "Step #3." Should be [2 4 7 1 3] Actual [4 8 2 3] Image after "Step #12" Should be [1 2 4 7 3] Ac...more...
  • Reported in: B4.0 (18-Jul-17)
#81844
PDF page: 74

Step 18's diagram doesn't show the '3' being inserted in the gap.--Matt Cree

  • Reported in: B4.0 (28-Jun-17)
#81747
PDF page: 76

"When examining at this pattern, ...."

should read

"When examining this pattern, ..."--Csaba Nemeth

  • Reported in: P1.0 (24-Nov-17)
#82300
PDF page: 81
This is more a question, shouldn't this line of code "for index in range(1, len(array)):"be len(array) -1 instead?. When it reaches to the last inde...more...
  • Reported in: B4.0 (04-Jun-17)
#81643
PDF page: 107
In the section about "Insertion Sort in Action", some of the images are wrong. - In Passthrough #1, Step #3 there is 4823, instead of 24713. - I...more...
  • Reported in: P1.0 (10-Sep-17)
#82055
PDF page: 117
In SortableArray#partition! while @array[right_pointer] > pivot do right_pointer -= 1 end The right pointer could go negative, it still works in...more...
  • Reported in: B4.0 (01-Jun-17)
#81619
PDF page: 124
The sentence right above step 7: "We compare the left pointer(2) to our pivot. Is the value the value less than the pivot? It is, so the left poi...more...
  • Reported in: P1.0 (10-Sep-17)
#82056
PDF page: 140

LinkedList#insert_at_index

Insert at index 0 does not seem to work.--Emen Zhao

  • Reported in: B4.0 (05-Jun-17)
#81650
PDF page: 143
First paragraph, last sentence: "The final node's link is contains null since the linked list ends there." Should be: "The final node's link ...more...
  • Reported in: B4.0 (05-Jun-17)
#81651
PDF page: 144
Second paragraph under Reading: "After all, the each node of a linked list can be anywhere in memory!" Should be: "After all, each node of a ...more...
  • Reported in: B4.0 (12-Jun-17)
#81671
PDF page: 178
3rd paragraph: "There are a number of ways that a graph can be implemented, but one of the simplest ways is using a hash table (see <titleref linke...more...
  • Reported in: B4.0 (12-Jun-17)
#81672
PDF page: 198
2nd paragraph: "This is because the database maintains the rows in order their ids, and the database can then use binary search to find each row." ...more...