Abstract: (7923 Views)
We give an overview of the running time analysis of the random divide-and-conquer algorithm FIND or QUICKSELECT. The results concern moments, distribution of FIND’s running time, the limiting distribution, a stochastic bound and the key: a stochastic fixed point equation.
Received: 2011/08/26 | Accepted: 2015/09/12 | Published: 2004/11/15