Suppose that the keys A through G, with the hash values given below, are inserted in some order into an initially empty table of size 7 using a linear-probing table (with no resizing for this problem).
key | A | B | C | D | E | F | G |
hash (M = 7) | 2 | 0 | 0 | 4 | 4 | 4 | 2 |
Which of the following could not possibly result from inserting these keys?
Give the minimum and the maximum number of probes that could be required to build a table of size 7 with these keys, and an insertion order that justifies your answer.
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.