Cart
A probabilistic analysis of the Floyd–Rivest expected time selection algorithm
- DOI:
- 10.1080/00207160512331331048
pages 509-519
Available online: 20 Aug 2006Abstract
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 (n 1/2) comparisons can be made into a randomized algorithm that performs n+C+O(n 1/2 log3/2 n) comparisons with probability at least 1−1/n ρ, for any constant ρ>0.
Keywords
- Recommend to:
- A friend
First page preview
Details
- Citation information:
- Available online: 20 Aug 2006
Author affiliations
- a CS Department, New Jersey Institute of Technology, Newark, NJ, 07102, USA
- b The American College of Greece, 6 Gravias Street, Aghia Paraskevi, Athens, 15342, Greece
Librarians
- Librarians' area
- Pricing
- Institutional account
- Access entitlements
- Co-branding
- IP ranges
- Link resolver preferences
- Usage reports