next up previous
Next: Theorem 12.5 Up: CSE 2320: Algorithms and Previous: Double Hashing

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$ = $\leq$ 1

Assume uniform hashing (each sequence is equally likely).

Copyright © 1998 The University of Texas at Arlington