An alternative analysis of the running time of randomized quicksort focuses on

the expected running time of each individual recursive call to RANDOMIZED$-$

QUICKSORT, rather than on the number of comparisons performed. As in the

analysis of Section $7\mathrm{.}4\mathrm{.}2,$ assume that the values of the elements are distinct.