next up previous
Next: Example Up: l5 Previous: Hash Tables

Analysis

Memory: $\Theta(\vert K\vert)$

Performance: $\Theta(1)$ average case, $\Theta(n)$ worst case



Instead of key k being stored in slot T[k], it is now stored in slot T[h(k)].

The function h(k) is the hash function.
The value of h(k) is the hash value of key k.


next up previous
Next: Example Up: l5 Previous: Hash Tables