Raport Badawczy = Research Report ; RB/79/2002
Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences
26 pages ; 21 cm ; Bibliography p. 22-26
It is shown 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 aveage 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
19 paź 2021
17 wrz 2020
46
https://rcin.org.pl./publication/174848
Nazwa wydania | Data |
---|---|
RB-2002-79 : Kiwiel Krzysztof Czesław : Randomized Selection Revisited | 19 paź 2021 |
Szkatuła, Krzysztof Tretyakov, Antonina