Q)Professor Marley hypothesizes that substantial performance gains can be obtained
if we modify the chaining scheme so that each list is kept in sorted order. How
does the professor’s modification affect the running time for successful searches,
unsuccessful searches, insertions, and deletions?
The above question was given in CLRS (HASHING,Exercise 11.2-3)
Can anyone please provide an answer and also explain on what basis are we going to sort the elements?
As, In a list all the elements have same key values
