We have a Hash Table with the size of 7
I0123456H[i]831445534764
And the hash function h(k) = Checksum(k) mod 7.
We use Quadratic probing.
a) In which order are the keys added
b) Is there an other order, that needs less average counts toinspect hash tables on succesfull searches?
Expert Answer
An answer will be send to you shortly. . . . .