Dictionary operations on hash tables are
O(1)
, on average, provided:
n = O(m)
(so load factor
α
is constant)
Chains are doubly linked
Simple Uniform Hashing
is used (all slots equally likely)
h(k)
can be computed in
O(1)
time