ERRATA

Page       Location/Correction
----       -------------------
*1         2nd paragraph, next-to-last line: "affect" SHOULD BE
           "effect"
*152       In Algorithm 3.6.5, "returns root" SHOULD BE
           "returns the root".
169        Change Exercise 8 to: Could Algorithm 4.4.1 find key
           even if the input is not in nondecreasing order?
*207       2 lines above Exercises: "n!" SHOULD BE "(n-1)!"
*207       Line above Exercises: "Theta(n!)" SHOULD BE
           "Omega((n-1)!)"
*209       In Exercise 24, "n!" SHOULD BE "(n-1)!"
*254       In Exercise 24, "c sub k" SHOULD BE "c sub i"
260        In Algorithm 6.4.4, "(a,10)" SHOULD BE "(a,9)".
*264       In the paragraph above Algorithm 6.5.2, delete
           "if the partition element is always placed at the 
           end of the array,"
*267       In Exercise 3, "k=0" SHOULD BE "k=1"
283        Exercise 6 is buggy.
*341       Last line of Exercise 5: "rows" SHOULD BE "columns"
336        In Exercise 8, "O(n)" SHOULD BE "O(A)".
404        The table in Example 9.5.12 should be

           0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
           1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 
           2 2 2 2 2 2 2 1 1 1 2 2 2 2 2 2 2 2 2 
           3 3 3 3 2 3 3 2 1 2 2 3 2 3 3 2 3 2 3 
           4 4 4 4 3 3 4 3 2 2 2 3 3 3 4 3 3 3 3 
           5 5 5 5 4 4 4 4 3 3 3 2 3 4 4 4 4 4 4 
           6 6 6 6 5 5 5 5 4 4 4 3 2 3 4 4 5 4 5  

413        Add the line
              return t.eps
           after the third line.
*419       Line 3: "match(w)" SHOULD BE "match(w,t)"
*497       Third to last line of algorithm: Remove ";"
*547       In iterated_local_search, "do" SHOULD BE "do {",
           and "repeat" SHOULD BE "do".
*549       In sa_independent_set_search, "c is not acceptable"
           SHOULD BE "eval(I) is not acceptable", and
           "output c" SHOULD BE "output I".
*631       In procedure echo(), insert the line

           counter = 0

           just before the line

           while (counter < |N|) {
720        The 7th line should be

           while (j < m && t[i + j] == p[j]) {

*Corrected in second printing.