Abstract
We present a probabilistic analysis of the Floyd-Rivest expected time selection algorithm. In particular, we show that a refinement of the bootstrapped version of the Floyd-Rivest algorithm that determines the Cth order statistic by performing an expected n + C + O(n1/2) comparisons can be made into a randomized algorithm that performs n + C + O(n1/2 log3/2 n) comparisons with probability at least 1 - 1/n ρ, for any constant ρ > 0.
Original language | English (US) |
---|---|
Pages (from-to) | 509-519 |
Number of pages | 11 |
Journal | International Journal of Computer Mathematics |
Volume | 82 |
Issue number | 5 |
DOIs | |
State | Published - May 2005 |
All Science Journal Classification (ASJC) codes
- Computer Science Applications
- Computational Theory and Mathematics
- Applied Mathematics
Keywords
- Algorithms
- Floyd-Rivest selection algorithm
- Randomization
- Selection