CS361 Hash with Linear and Quadratic Probing

For purposes of illustration, this hash table uses a deliberately weak choice of hash functions. Strings are hashed by their length (e.g., "Davis" and "Smith" would each have a hash code of 5).

Quick instructions:

• Select operations from the Algorithm menu.
• Use the "step" button to single-step through the code or use the "play" button to run all the way to the end of the calculation.

More detailed help is available from the Help menu.