3.10.1: Double hashing, |X3zay7 Jump to level 1 valsTable: 0 Empty-since-start 1 78 Empty-after-removal 2 Occupied 3 4 1

[answerhappygod]

3 10 1 Double Hashing X3zay7 Jump To Level 1 Valstable 0 Empty Since Start 1 78 Empty After Removal 2 Occupied 3 4 1 1 (45.43 KiB) Viewed 43 times

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