Randomized selection revisited

2002/04/15 by Krzysztof C. Kiwiel, Kiwiel, Krzysztof C.
Computer Science · #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #G3 #cs.DS

paper · pdf · doi:10.48550/arxiv.cs/0204033

25 pages, LaTeX 2e

arxiv created 2002/04/15 · arxiv updated 2009/11/30

Abstract

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.

Related

• Randomized selection with quintary partitions
• Improved randomized selection
• Randomized selection with tripartitioning
• Selection Algorithms with Small Groups
• Approximate Selection with Unreliable Comparisons in Optimal Expected Time