Hash Tables
- A hash table can be implemented as an array of buckets
- Buckets are sequences of nodes that hold elements with the same hash code
- If there are few collisions, then adding, locating, and removing hash table
elements takes constant time
- For this algorithm to be effective, the bucket sizes must be small
- The table size should be a prime number larger than the expected number
of elements
- An excess capacity of 30% is typically recommended