Example

Example

Note that there are cases in which the expected running time of an algorithm is very fast, but there is no bound on the worst-case running time.

algorithm92

T = 1 + 1/2 (0) + 1/2 T
T = 1 + 1/2 + 1/4 + 1/8 + ...
T = 2

$next$ $up$ $previous$
Next: RANDOMIZED QUICKSORT Up: PROBABILITY THEORY Previous: Expected Running Time