Errata

I'm very backlogged on these.
Please be patient for a reply. Thanks!

First printing

  DATE   PAGE  WHO  PROBLEM
--------  ---  ---  ----------------------------------------------------------
06/01/07  031  HEP  In Fig 1.20, line 4, remove the stray semicolon
                    between m2 and ("hello"); 
06/01/07  043  KD   In Def 2.4, change "all constants c" to "all positive constants c" 
11/12/05  069  MAW  Change line 5 to line 15 in Exercise 2.31.
01/23/06  085  A    Second to last sentence in second to last paragraph,
                    change "itera tor" to "iterator"
07/26/06  093  PA   Figure 3.20, line 16, use start and end, not from and to.
                    And on line 19, return end.
02/07/06  120  MAW  First sentence of Sec 4.21, change "tree has at most"
                    to "tree node has at most"
02/07/06  136  MAW  Last line, change .328 to 1.328.
08/01/06  138  PJV  Figure 4.33, the far right node at height 7 is missing its l
eft child.
02/07/06  147  MAW  Next to last line, change "rotateWithLeftChild" to
                    "rotateWithRightChild"
02/07/06  149  MAW  In Sec 4.5, paragraph 2, line 2, change "as long at it" to
                    "as long as it"
02/07/06  161  DH   Item 5, change "L children" to L "data items"
02/07/06  162  DH   Line 5, change "first level could " to "next level could"
10/16/07  168  GO   Four lines from the bottom, change "two characters" to "two words"
02/07/06  175  MAW  In Exercise 4.10 change "in a binary search tree" to
                    "in an N node binary search tree" (with N italicized)
11/14/05  265  MAW  At start of Section 7.3, change "inversion" from italics
                    to boldface.
09/26/06  273  HK   In heapsort, the loop at line 7 can start at a.length / 2 -
 1.
02/08/06  307  MAW  In Exercise 7.10, change "ikne 2" to "line 8" in two places.
06/27/06  323  EEO  In the second line from the bottom of the page, "tree" should
                    be replaced by "forest".
11/26/05  397  MAW  In Exercise 9.2, change Section 9.1 to Section 9.2.
07/11/06  ???  MAW  At the end of Chapter 9, in the references, add the
                    following as the best deterministic minimum spanning tree algorithm:
                     Bernard Chazelle: A minimum spanning tree algorithm with
                     Inverse-Ackermann type complexity. J. ACM 47(6): 1028-1047 (2000)

Credits

A    Adam 
DH   Dennis Hamilton
EEO  Evelyn Obaid
GO   Greg Ozbirn
HEP  Hans Ekkehard Plesser
HK   Heinrich Kuettler
KD   Ketil Danielsen
PA   Peter Allen
PJV  Peter J. van Wesep

Printing History

1 2 3 4 5 6 7 8 9 10