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


CHAPTER 1

No errata reported at this time.


CHAPTER 2

No errata reported at this time.


CHAPTER 3

No errata reported at this time.


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.

CHAPTER 6

No errata reported at this time.