next up previous
Next: Corollary 12.6 Up: CSE 2320: Algorithms and Previous: Analysis of Open Addressing

Theorem 12.5

The expected number of probes in an unsuccessful search is at most 1/(1-$\alpha$).

For example, if the table is half full, $\alpha$ = 0.5, the number of probes is .

If the table is 90% full, $\alpha$ = 0.9, the number of probes is .

If $\alpha$ is constant, the performance of an unsuccessful search is .



Copyright © 1998 The University of Texas at Arlington