Question: A large number of deletions in a separate chaining hash table can cause the table to be fairly empty, which wastes space. In this case,
A large number of deletions in a separate chaining hash table can cause the table to be fairly empty, which wastes space. In this case, we can rehash to a table half as large. Assume that we rehash to a larger table when there are twice as many elements as the table size. How empty should the table be before we rehash to a smaller table?
Step by Step Solution
3.50 Rating (187 Votes )
There are 3 Steps involved in it
We must be careful not to rehash too often Let p be the threshold fraction of table s... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
1486-C-S-A(371).docx
120 KBs Word File
