next up previous
Next: Example Up: CSE 2320: Algorithms and Previous: Hash Tables


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 .

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

Copyright © 1998 The University of Texas at Arlington