Errata for Algorithms, 4th Edition, Eleventh Printing (October 2017)


CHAPTER 1

No errata reported at this time.


CHAPTER 2


p. 280, figure

Printed: leaf nodes 120 and 201
Fixed: leaf nodes 120 and 201 should be swapped
Reported by Arthur Jochems, 16-Jun-19.


CHAPTER 3


p. 383, Proposition B

Printed: Repeating the previous step n – 2 additional times
Fixed: Repeating the previous step k – 2 additional times
Reported by XingFan Shen, 26-Feb-19.


p. 454, Exercise 3.3.39

Printed: return h;
Fixed: flipColors() is a void method and does not return a value
Reported by Dmitry Klionsky, 18-Mar-19.


CHAPTER 4


p. 625, Proposition N

Printed: cost of at most E compares
Fixed: cost of at most 2E compares
Reported by Sebastian Wild, 8-Sep-18.

p. 655, Algorithm 4.9

Printed: Iterable<Edge> pathTo(int v)
Fixed: Iterable<DirectedEdge> pathTo(int v)
Reported by Hafidz Jazuli Luthfi, 19-Dec-17.


p. 685, Exercise 4.4.3

Printed: see Exercise 4.3.9
Fixed: see Exercise 4.3.10
Reported by Rene Argento, 29-Nov-17.


p. 689, Exercise 4.4.45

Printed: breaks the linearithmic barrier
Fixed: breaks the m n barrier
Reported by Richard Mu, 06-Dec-18.


CHAPTER 5

p. 705, code box

Printed: Item[] aux = new String[n];
Fixed: Item[] aux = new Item[n];
Reported by Dmitry Klionsky, 13-Feb-19.


p. 776

Printed: The hashSearch() method
Fixed: The search() method
Reported by Dmitry Klionsky, 18-Mar-19.

CHAPTER 6


p. 889

Printed: localEq(v)
Fixed: localEq(v, G)
Reported by Irina Brindeeva, 17-Jul-19.