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 
p. 306, Exercise 2.3.20
Printed:  Push the larger of the subarrays onto the stack 
Fixed:  Push the smaller of the subarrays onto the stack 
p. 310, table
Printed:  Space for PQ client using heapbased implementation = n 
Fixed:  Space for PQ client using heapbased implementation = m 
CHAPTER 3
p. 383, Proposition B
Printed:  Repeating the previous step n – 2 additional times 
Fixed:  Repeating the previous step k – 2 additional times 
p. 454, Exercise 3.3.39
Printed:  return h;

Fixed:  flipColors() is a void method and does not return a value

p. 466, Proposition K
Printed:  Poisson tail probability (α e/t)^{t} e^{α} 
Fixed:  (e/t)^{α t} e^{α} 
p. 471, code box
Printed:  i = (i + 1) % M

Fixed:  i = (i + 1) % m

CHAPTER 4
p. 625, Proposition N
Printed:  cost of at most E compares 
Fixed:  cost of at most 2E compares 
p. 642, caption
int v = e.
from()
, int w = e.
to()
Printed: 
int v = e. to()
, int w = e. from()

Fixed: 
p. 655, Algorithm 4.9
Printed:  Iterable<Edge> pathTo(int v)

Fixed:  Iterable<DirectedEdge> pathTo(int v)

p. 685, Exercise 4.4.3
Printed:  see Exercise 4.3.9 
Fixed:  see Exercise 4.3.10 
p. 689, Exercise 4.4.45
Printed:  breaks the linearithmic barrier 
Fixed:  breaks the m n barrier 
CHAPTER 5
p. 705, code box
Printed:  R()

Fixed:  radix()

p. 705, code box
Printed:  Item[] aux = new String [n];

Fixed:  Item[] aux = new Item [n];

p. 717, Proposition D
Printed:  Worst case is Theta(w(n + R)) from all equal strings 
Fixed:  Worst case is Theta(w n R) from all n/2 pairs of equal strings 
p. 733, figure
Printed:  no link for the o, so return she

Fixed:  no link for the o, so return null

p. 776
Printed:  The hashSearch() method

Fixed:  The search() method

p. 814
Printed:  if (width == 0) continue;

Fixed:  if (width == 0) { BinaryStdIn.readBoolean(); continue; }

p. 847, Exercise 5.5.3
Printed:  { 01, 10, 011, 110 } 
Fixed:  remove { 01, 10, 011, 110 }; it is not uniquely decodable (01110) 
CHAPTER 6
p. 870
Printed:  key–value pairs of rank greater than M/2 
Fixed:  key–value pairs of rank greater than (or equal to) M/2 
p. 889
Printed:  localEq(v)

Fixed:  localEq( G , v)

p. 900
Printed:  each edge can be on at most V / 2 augmenting paths 
Fixed:  an edge can be a critical edge on at most V / 2 augmenting paths 