Dictionaries and Hashing
Assume that you have a ten-slot closed hash table (the slots arenumbered 0 through 9). Show the final hash table that would resultif you used the hash function h(k) = k mod 10 and quadratic probing(e.g. p(K,i)=i2{“version”:”1.1″,”math”:”( p(K, i) = i^2)”}) on this list of numbers: 3, 12, 9, 2, 79, 46
Solution
Hash table:————–0 -> 791 ->2 -> 123 -> 34 -> 5 -> 6 -> 27 -> 468 ->9 ->
OR
OR