Consider a hash table with 10 slots and the collisions are resolved by linear probing. The following keys are inserted in the order: 15, 2, 1, 5, 20, 31, 12, 21, 17, 34.
The hash function is ℎ(k) = k mod 10. The hash table state will be,
1
2
3
4
Consider a hash table with 10 slots and the collisions are resolved by linear probing. The following keys are inserted in the order: 15, 2, 1, 5, 20, 31, 12, 21, 17, 34.
The hash function is ℎ(k) = k mod 10. The hash table state will be,