next up previous
Next: Hash Functions Up: l5 Previous: Analysis of Chaining

Question:

Would it help to keep chains sorted?

In this case,



Insert = \(\Theta(1 + \alpha)\)
Search = \(\Theta(1 + \alpha)\)
Delete = \(\Theta(1 + \alpha)\)

Asymptotically, no help. This reduces constant on search, but increases constant for Insert. Delete is the same as before.

Basically, no.


next up previous
Next: Hash Functions Up: l5 Previous: Analysis of Chaining