Double probing. Run experimental studies to evaluate the effectiveness of double probing (see exercise3.4.27).
Exercise 3.4.27:
Double probing. Modify SeparateChainingHashST to use a second hash function and pick the shorter of the two lists. Give a trace of the process of inserting the keys E A S Y Q U T I O N in that order into an initially empty table of size M =3 using the function 11*k % M (for the kth letter) as the first hash function and the function 17*k % M (for the kth letter) as the second hash function. Give the average number of probes for random search hit and search miss in this table.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.