In the quadratic probing hash table, suppose that instead of inserting a new iteminto
Chapter 5, Problem 5.7(choose chapter or problem)
In the quadratic probing hash table, suppose that instead of inserting a new iteminto the location suggested by findPos, we insert it into the first inactive cell on thesearch path (thus, it is possible to reclaim a cell that is marked deleted, potentiallysaving space).a. Rewrite the insertion algorithm to use this observation. Do this by having findPosmaintain, with an additional variable, the location of the first inactive cell itencounters.b. Explain the circumstances under which the revised algorithm is faster than theoriginal algorithm. Can it be slower?
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer