Improved randomized selection

Details Improved randomized selection Improved randomized selection

2004-02-02

arxiv.org/abs/cs/0402005v1

Computer Science

Data Structures and Algorithms

14 pages

Scientific paper

We show that several versions of Floyd and Rivest's improved algorithm Select for finding the $k$th smallest of $n$ elements require at most $n+\min\{k,n-k\}+O(n^{1/2}\ln^{1/2}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. Encouraging computational results on large median-finding problems are reported.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-627574