Errata, Chapter 4
p. 431
| Printed: | As with Complex paragraph |
| Fixed: | rewrite to correct grammar |
p. 485, table
| Printed: | logarithmic 1000 |
| Fixed: | remove row corrresponding to logarithmic |
p. 490-491
| Printed: | Charge object uses 20 bytes and Complex object uses 16 bytes |
| Fixed: | Charge objects uses 32 bytes and Complex object uses 24 bytes |
p. 493, table
| Printed: | 8N^2 + 20N + 16 and 16N^2 + 20N + 16 |
| Fixed: | 4N^2 + 20N + 16 and 8N^2 + 20N + 16 |
p. 501, Exercise 4.1.10
| Printed: | 5 seconds, 20 seconds, 45 seconds, 80 seconds, 125 seconds |
| Fixed: | 5 seconds, 20 seconds, 45 seconds, 80 seconds |
p. 515, Program 4.2.2
| Printed: | void (twice) |
| Fixed: | double |
p. 515, Program 4.2.2
| Printed: | m (twice) |
| Fixed: | mid |
p. 515
| Printed: | Test whether Φ(m) < y |
| Fixed: | Test whether Φ(m) > y |
p. 527, mergesort trace
| Printed: | was was but but was was was but |
| Fixed: | was was was was was was was was |
p. 563
| Printed: | if (N == a.length/4) resize(a.length/2); |
| Fixed: | if (N > 0 && N == a.length/4) resize(a.length/2); |
p. 587
| Printed: | iterate from i = 0 to N-1 (FIFO order) private int i = 0; public boolean hasNext() { return i < N; } public Item next() { return a[i++]; } |
| Fixed: | iterate from i = N-1 to 0 (LIFO order) private int i = N; public boolean hasNext() { return i > 0; } public Item next() { return a[--i]; } |
pp. 622, 623, 624, 626
| Printed: | of appears before it alphabetically |
| Fixed: | replace of with if |
p. 624
| Printed: | if the search ley is less, we set the right link |
| Fixed: | if the search ley is greater, we set the right link |
p. 635
| Printed: | ST on the booksite uses java.util.TreeSet |
| Fixed: | SET on the booksite uses java.util.TreeSet |
p. 665, Program 4.5.3
| Printed: | delimeter |
| Fixed: | delimiter |
