Raport Badawczy = Research Report ; RB/69/2003
Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences
21 pages ; 21 cm ; Bibliography p. 19-21
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 and with high probability. This rectifies the analysis of Floyd and Rivest, and extends it to the case of nondistinct elements. The obtained 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
44
https://rcin.org.pl./publication/174949
Edition name | Date |
---|---|
RB-2003-69 : Kiwiel Krzysztof Czesław : Randomized Selection with Quintary Partitions | Oct 19, 2021 |
Szkatuła, Krzysztof Tretyakov, Antonina
Darwin, Charles Robert, (1809–1882)