previous |
start |
next
Simplistic Implementation of a Hash Table
- To implement
- Generate hash codes for objects
- Make an array
- Insert each object at the location of its hash code
- To test if an object is contained in the set
- Compute its hash code
- Check if the array position with that hash code is already
occupied
previous |
start |
next