@misc{Kiwiel_Krzysztof_On_2004, author={Kiwiel, Krzysztof}, copyright={Creative Commons Attribution BY 4.0 license}, address={Warszawa}, journal={Raport Badawczy = Research Report}, howpublished={online}, year={2004}, publisher={Instytut Badań Systemowych. Polska Akademia Nauk}, publisher={Systems Research Institute. Polish Academy of Sciences}, language={eng}, abstract={The paper shows 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 computational results confirm that Select may be the best algorithm in practice.}, title={On Floyd and Rivest's SELECT Algorithm}, type={Text}, URL={http://rcin.org.pl/Content/139623/PDF/RB-2004-68.pdf}, keywords={Medians, Computational complexity, Partitioning, Selection}, }