previous |
start |
next
Hash Tables
- A hash table can be implemented as an array of buckets
- Buckets are sequences of links that hold elements with the same
hash code
- The table size should be a prime number larger than the
expected number of elements
- If there are few collisions, then adding, locating, and
removing hash table elements takes constant time
- Big-Oh notation: O(1)
previous |
start |
next