Randomized selection with quintary partitions

Details Randomized selection with quintary partitions Randomized selection with quintary partitions

2003-12-23

arxiv.org/abs/cs/0312055v1

Computer Science

Data Structures and Algorithms

21 pages

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.

Affiliated with

Also associated with

No associations

Rating

Randomized selection with quintary partitions 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 with quintary partitions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Randomized selection with quintary partitions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-323036