Advanced search
Advanced search
Advanced search
Advanced search
Advanced search
Raport Badawczy = Research Report ; RB/70/2003
Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences
19 stron ; 21 cm ; Bibliografia s. 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
Licencja Creative Commons Uznanie autorstwa 4.0
Zasób chroniony prawem autorskim. [CC BY 4.0 Międzynarodowe] Korzystanie dozwolone zgodnie z licencją Creative Commons Uznanie autorstwa 4.0, której pełne postanowienia dostępne są pod adresem: ; -
Instytut Badań Systemowych Polskiej Akademii Nauk
Biblioteka Instytutu Badań Systemowych PAN
Oct 19, 2021
Sep 17, 2020
69
https://rcin.org.pl./publication/174957
Edition name | Date |
---|---|
RB-2003-70 : Kiwiel Krzysztof Czesław : Randomized Selection with Tripartitioning | Oct 19, 2021 |
Szkatuła, Krzysztof Tretyakov, Antonina
Darwin, Charles Robert, (1809–1882)