2003/12/23 by Krzysztof C. Kiwiel, Kiwiel, Krzysztof C. · 1 citation
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Algorithms and Data Compression #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #G3 #Limits and Structures in Graph Theory #cs.DS
paper · pdf · doi:10.48550/arxiv.cs/0312055
21 pages
arxiv created 2003/12/23 · openalex publication_date 2003/12/23 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We show 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. Our computational results confirm that Select may be the best algorithm in practice.