Hashing with Separate Chaining

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). This will yield more (and more easily predictable) collisions than would be seen with a proper hash function.

1. Installing and Launching

1. Download the .jar file for this animation and save it in any convenient directory on your PC.
2. To run this animation, you will need the Java 8 Runtime Environment (JRE). Download and install it if you don't have it already.
3. In most operating systems. you should be able to launch the animation by double-clicking on the .jar file you downloaded in step 1.
   • If that does not work, open a command window, cd to the directory where you saved the .jar file, and try the command

     java -jar algae-dsft-hashchain.jar

2. Operating Instructions

• Select a desired algorithm from the Algorithm menu.
• Use the speed control to slow down the animation if desired.
• Alternatively, use the pause button.
  • When execution pauses inside of an algorithm, press the "step" button to single-step through the code or use the "play" button to resume continual execution.
• • If you find the display is too hopelessly tangled, you can use your mouse to drag the nodes to more appropriate positions whenever you are paused within a running algorithm.

More detailed help is available from the Help menu.

This demo was prepared with the AlgAE animation engine.