Raport Badawczy = Research Report ; RB/68/2004
Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences
24 pages ; 21 cm ; Bibliography p. 22-24
The paper shows that several versions of Floyd and Rivest’s algorithm Select for finding the kth smallest of n elements require at most n + min{k, n — k} + o(n) comparisons on average and with high probability. This rectifies the analysis of Floyd and Rivest, and extends it to the case of nondistinct elements. The computational results confirm that Select may be the best algorithm in practice.
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
90
https://rcin.org.pl./publication/175065
Edition name | Date |
---|---|
RB-2004-68 : Kiwiel Krzysztof Czesław : On Floyd and Rivest's SELECT Algorithm | Oct 19, 2021 |
Sedláček, Ondřej Fuchs, Roman Exnerová, Alice
Canova, L. Fasola, M.