Advanced search
Advanced search
Advanced search
Advanced search
Advanced search
Raport Badawczy = Research Report ; RB/67/2004
Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences
14 pages ; 21 cm ; Bibliography p. 14
The paper shows that several versions of Floyd and Rivest’s improved algorithm SELECT for finding the kth smallest of n elements require at most n + min{k, n — k} +O (n1/2ln1/2n) comparisons on average and with high probability. This rectifies the analysis of Floyd and Rivest, and extends it to the case of nondistinct elements. Encouraging computational results on large median-finding problems are reported.
Raport Badawczy = Research Report
Creative Commons Attribution BY 4.0 license
Copyright-protected material. [CC BY 4.0] May be used within the scope specified in Creative Commons Attribution BY 4.0 license, full text available at: ; -
Systems Research Institute of the Polish Academy of Sciences
Library of Systems Research Institute PAS
Oct 19, 2021
Sep 17, 2020
38
https://rcin.org.pl./publication/175055
Edition name | Date |
---|---|
RB-2004-67 : Kiwiel Krzysztof Czesław : Improved Randomized Selection | Oct 19, 2021 |
Szkatuła, Krzysztof Tretyakov, Antonina