previous |
start |
next
Hash Tables
- Hashing can be used to find elements in a data structure
quickly without making a linear search
- A hash function computes an integer value (called the hash
code) from an object
- A good hash function minimizes collisions, identical
hash codes for different objects
- To compute the hash code of object
x: int h = x.hashcode()
previous |
start |
next