Advanced search
Advanced search
Advanced search
Advanced search
Advanced search
Raport Badawczy = Research Report ; RB/80/2002
Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences
20 pages ; 21 cm ; Bibliography p. 19-20
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, even when equal elements occur. This parallels recent analysis of another variant due to Floyd and Rivest.The computational results suggest that both variants perform well in practice, and may compete with other selection methods, such as Hoare’s Find or quickselect with median-of-three partitioning.
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
33
https://rcin.org.pl./publication/174855
Edition name | Date |
---|---|
RB-2002-80 : Kiwiel Krzysztof Czesław : Randomized Selection with Tripartitioning | Oct 19, 2021 |
Szkatuła, Krzysztof Tretyakov, Antonina