Question: Suppose we have stored n keys in a hash table of size m, with collisions resolved by chaining, and that we know the length of
Suppose we have stored n keys in a hash table of size m, with collisions resolved by chaining, and that we know the length of each chain, including the length L of the longest chain. Describe a procedure that selects a key uniformly at random from among the keys in the hash table and returns it in expected time O(L · (1 + 1/α)).
Step by Step Solution
3.43 Rating (159 Votes )
There are 3 Steps involved in it
We can view the hash table as if it had m rows and L columns each row stores one chain The arr... View full answer
Get step-by-step solutions from verified subject matter experts
