next up previous
Next: Hash Functions Up: CSE 2320: Algorithms and Previous: Analysis of Chaining


Would it help to keep chains sorted?

In this case,

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

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

Basically, .

Copyright © 1998 The University of Texas at Arlington