Exponential bounds for the running time of a selection algorithm (Q760796)

Hoare's selection algorithm for finding the kth-largest element in a set of n elements is shown to use C comparisons where (i) \(E(C^ p)\leq A_ pn^ p\) for some constant \(A_ p>0\) and all \(p\geq 1\); (ii) P(C/n\(\geq u)\leq (3/4)^{u(1+o(1))}\) as \(u\to \infty\). Exact values for the \(''A_ p''\) and ''o(1)'' terms are given.