Functional notation
In computer science, the Floyd–Rivest algorithm is a highly efficient selection algorithm – its expected number of comparisons is optimal to within lower-order terms.
The algorithm was originally presented in a Stanford University technical report containing two papers, where it was paired with median of medians.[1]
It was subsequently published in Template:Harvtxt.
In the original paper the algorithm is referred to as SELECT; contrast with FIND for quickselect and PICK for median of medians.
References
43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro. Template:Refbegin
- Template:Cite doi
- Template:Cite doi
- "A probabilistic analysis of the Floyd-Rivest expected time selection algorithm" (2002), by Alexandros V. Gerbessiotis, Constantinos J. Siniolakis, Aghia Paraskevi
- ↑ "Two papers on the selection problem: Time Bounds for Selection and Expected Time Bounds for Selection" CS-TR-73-349, Stanford Computer Science Technical Reports and Technical Notes, April 1973