The Algorithm Visualization Catalog is a comprehensive collection of links to algorithm visualizations, or AVs.

Data Structure Visualization - Hashing

Link(s)
http://www.cs.usfca.edu/galles/visualization
Topic(s)
Hashing, Search Algorithms



Recommendation
  
Lecture Aide Has Potential
Self-study Supplement Not Recommended
Standalone Not Recommended
Debugging Aide Has Potential
Works?
Yes
Delivery Method(s)
Java Application, JavaScript
Project
Data Structure Visualization
Project Relationship
Part of project
Language(s)
English
Author(s)
David Galles
Institution(s)
University of San Francisco
Activity Level(s)
Animation, Slideshow, Step control, User data
Source Code License
Open source (non-OSI)
First Published
N/A
Last Modified
2011

Description

Demonstrations for three types of hashing: Open hashing (with simple mod function), closed hashing (with simple mod function and three collision resolution methods: Linear probing, quadratic probing, and double hashing), and bucket hashing.

Evaluation

Simple presentation. Generally clear, with some weak points. Only supports mod function for hash function. The hash table size is fixed at an awkward size that makes this harder than necessary to understand. Would have been better to pick a table size easier to mod in one’s head (such as 20). String hash function is incomprehensible. No explanation of what the 2nd hash function is for double hashing. And since the computation explanation goes away at the last step, the user doesn’t get to see what is going on to figure it out. Better step-by-step explanations would help make things clearer.

Usage Notes

The URL above takes you to a page with menu items on the left to get to the implementation of choice (Java, JavaScript). From there, click on the visualization that you wish to see.

Field Report(s)
References
N/A
Rating
0
No votes yet
Your rating: None
AV of the Day
No
Score
29