Volume 3, Issue 2 (November 2004)                   JIRSS 2004, 3(2): 271-296 | Back to browse issues page

XML Persian Abstract Print

Abstract:   (7424 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.
Full-Text [PDF 225 kb]   (2672 Downloads)    

Received: 2011/08/26 | Accepted: 2015/09/12 | Published: 2004/11/15