Computer Science – Data Structures and Algorithms
Scientific paper
2002-04-15
Computer Science
Data Structures and Algorithms
25 pages, LaTeX 2e
Scientific paper
We show that several versions of Floyd and Rivest's algorithm Select for finding the $k$th 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.
No associations
LandOfFree
Randomized selection revisited does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Randomized selection revisited, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Randomized selection revisited will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-383279