Algorithmic Thinking 2/E Errata

Hi everyone,

I’m loving the reader engagement on this edition… thank you!

I’m putting in my all to have an error-free book. Is that even possible? Well, maybe – my readers are awesome :)

I’m going to note all discovered errors here. I fix them as soon as possible in print/ebook versions of the book (they will no longer be fixed in the 1/e first edition, though). Thank you all for your care for this learning resource and others’ learning. Let’s keep going!

Special thanks for helping me find and fix these: Jarno Mielikainen, James Cummings, Amin Mir, and … maybe you? :)

Chapter 2

• Page 71: in Listing 2-24, the malloc call on the code line numbered 4 should be using sizeof(node *) instead of sizeof(node).

• Page 75: in Listing 2-29, same typo as above, the malloc call on the code line numbered 1 should be using sizeof(node *) instead of sizeof(node).

Chapter 4

• Page 161: the text said For example, the first call is for the move that goes up two and right one. That’s wrong. That call is actually for up one and right two.
• Page 165: the text said that the program outputs Loss in 3 knight move(s).. It should say instead Win in 3 knight move(s).

Chapter 10

• Page 281: the text said A typical long integer can hold values up to about 4 billion. That should be 2 billion, not 4 billion.
• Page 378: the text talks about rand taking an integer parameter. Umm, oops! It doesn’t take any parameters. The code is correct.

Written on April 18th, 2024 by Daniel Zingaro