A probabilistic analysis of the Floyd-Rivest expected time selection algorithm

Authors

Alexandros V. Gerbessiotis, New Jersey Institute of Technology
Constantinos J. Siniolakis, The American College of Greece

Document Type

Article

Publication Date

5-1-2005

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(n^1/2) comparisons can be made into a randomized algorithm that performs n + C + O(n^1/2 log^3/2 n) comparisons with probability at least 1 - 1/n ^ρ, for any constant ρ > 0. © 2005 Taylor & Francis Ltd.

Identifier

27844590008 (Scopus)

Publication Title

International Journal of Computer Mathematics

External Full Text Location

https://doi.org/10.1080/00207160512331331048

e-ISSN

10290265

ISSN

00207160

First Page

509

Last Page

519

Issue

5

Volume

82

Recommended Citation

Gerbessiotis, Alexandros V. and Siniolakis, Constantinos J., "A probabilistic analysis of the Floyd-Rivest expected time selection algorithm" (2005). Faculty Publications. 19705.
https://digitalcommons.njit.edu/fac_pubs/19705