Data Structure Visualization - Closed Hashing
Recommendation |
Has Potential |
||||
Link |
|||||
Delivery Method |
Java Application |
||||
License |
Unlicensed Sourcecode |
||||
Language |
English |
||||
Author |
David Galles |
||||
Institution |
University of San Francisco |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Demonstrates standard closed hashing with a simple (mod) hash function. Allows choice of various collision resolution policies: linear probing, quadratic probing, and double hashing. |
||||
Evaluation |
Simple presentation. Generally clear, with some weak points. Only supports mod function for hash function. The hash table size of 23 makes this hard 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. |
||||
Animation; Step Control; User Data |
|||||
Lecture Aid; Debugging |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-09-01 |
||||
Last Visited |
2008-07-02 |
||||
Last Updated |
2006-04-05 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
