next up previous
Up: CSE 2320: Algorithms and Previous: Corollary 12.6

Theorem 12.7

The expected number of probes in a successful search is at most

\begin{displaymath}\frac{1}{\alpha} ln \frac{1}{1 - \alpha} \;+\; \frac{1}{\alpha}.\end{displaymath}

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

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

If $\alpha$ is constant, the performance of a successful search is .



Copyright © 1998 The University of Texas at Arlington