If you use the first edition of the textbook, follow the reading material
in orange. If you use the second edition,
follow the reading material in brown.
pages 286-287 (Section 7.6.1),
pages 290-291 (Section 7.6.3)
pages 346-357 (Section 8.3.5-8.3.7)
Implementation of a dictionary by means of a hash table:
Pseudocode for linear probing:
Give an example of the quadratic probing strategy not finding an empty
bucket even though there is one. You do not need more than five buckets.