Volume 3, Number 2 (November 2004) |
JIRSS 2004, 3(2): 271-296 |
Back to browse issues page
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
R¨osler U. QUICKSELECT Revisited. JIRSS. 2004; 3 (2) :271-296
URL: http://jirss.irstat.ir/article-1-113-en.html
URL: http://jirss.irstat.ir/article-1-113-en.html
Abstract: (4516 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.
Keywords: analysis of algorithms, asymptotic distribution, FIND, FIND process, QUICKSELECT, stochastic algorithm, stochastic fixed point equation.
Subject:
60: Probability theory and stochastic processes
Received: 2011/08/26 | Accepted: 2015/09/12
Received: 2011/08/26 | Accepted: 2015/09/12
