Question: In the quadratic probing hash table, suppose that instead of inserting a new item into the location suggested by findPos, we insert it into the
a. Rewrite the insertion algorithm to use this observation. Do this by having find-Pos maintain, with an additional variable, the location of the first inactive cell it encounters.
b. Explain the circumstances under which the revised algorithm is faster than the original algorithm. Can it be slower?
Step by Step Solution
3.34 Rating (163 Votes )
There are 3 Steps involved in it
b If the number of deleted cells is sm... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
1486-C-S-A(374).docx
120 KBs Word File
