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:

More detailed help is available from the Help menu.

Oops. This browser does not display Java applets.

Email me at zeil@cs.odu.edu