3.10.1: Double hashing. 2x3747 Jump to level 1 vals Table: 0 Empty-since-start 1 Empty-after-removal 2 Occupied 3 4 5 Ha

[answerhappygod]

3 10 1 Double Hashing 2x3747 Jump To Level 1 Vals Table 0 Empty Since Start 1 Empty After Removal 2 Occupied 3 4 5 Ha 1 (46.35 KiB) Viewed 30 times

3.10.1: Double hashing. 2x3747 Jump to level 1 vals Table: 0 Empty-since-start 1 Empty-after-removal 2 Occupied 3 4 5 Hash table valsTable uses double probing with the hash functions hash1(key): key % 11 hash2(key): 5 - key%5 and a table size of 11. 6 39 7 8 63 Hashinsert(valsTable, item 28) inserts item 28 into bucket Ex: 10 9 Hashinsert(valsTable, item 83) inserts item 83 into bucket 10 Hashinsert(valsTable, item 60) inserts item 60 into bucket