next up previous
Next: Pseudocode Up: CSE 2320: Algorithms and Previous: Universal Hash Functions

Open Addressing

*
All elements are stored in the hash table (no pointers).
*
If a hash slot is full, then other slots using the until a slot is found or no slot can be found (overflow).
*
The hash function now becomes , where i ranges over {0,1,..,m-1}.
h(k,i) returns the ith probe in the probe sequence.
*
The entire probe sequence must be a permutation of {0,1,..,m-1}.



Copyright © 1998 The University of Texas at Arlington