next up previous
Next: Theorem 12.5 Up: l5 Previous: Example

Analysis of Open Addressing

Let n be the number of elements in the table,
m is the size of the table.

n $\leq$ m
$\alpha$ = n/m $\leq$ 1



Assume uniform hashing (each sequence is equally likely).


next up previous
Next: Theorem 12.5 Up: l5 Previous: Example