Wyszukiwanie zaawansowane
Wyszukiwanie zaawansowane
Wyszukiwanie zaawansowane
Wyszukiwanie zaawansowane
Wyszukiwanie zaawansowane
Raport Badawczy = Research Report ; RB/70/2003
Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences
19 pages ; 21 cm ; Bibliography p. 16,18-19-0
It has been 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 average, even when equal elements occur. This parallels our recent analysis of another variant due to Floyd and Rivest. The obtained 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-3 pivots.
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
70
https://rcin.org.pl./publication/174957
Nazwa wydania | Data |
---|---|
RB-2003-70 : Kiwiel Krzysztof Czesław : Randomized Selection with Tripartitioning | 19 paź 2021 |
Szkatuła, Krzysztof Tretyakov, Antonina