Double Hashing
Each key probes with its own stride, 1 + key mod (size - 1), so keys with the same home follow different paths.
Cost
- Insert
- O(1) expected
- Search
- O(1) expected
- Worst case op
- O(n)
- Space
- O(capacity)
Before this
Related
Taught by the same lesson
Hash Table covers these too, in the same run.