Abstract
We describe an algorithm for selecting the αn-th largest element (where 0<α<1), from a totally ordered set ofn elements, using at most (1+(1+o(1))H(α))·n comparisons whereH(α) is the binary entropy function and theo(1) stands for a function that tends to 0 as α tends to 0. For small values of α this is almost the best possible as there is a lower bound of about (1+H(α))·n comparisons. The algorithm obtained beats the global 3n upper bound of Schönhage, Paterson and Pippenger for α<1/3.
Similar content being viewed by others
References
M. Blum, R.W. Floyd, V. Pratt, R.L. Rivest, andR.E. Tarjan: Time bounds for selection,Journal of Computer and System Sciences,7 (1973), 448–461.
S.W. Bent andJ.W. John: Finding the median requires 2n comparisons, InProceedings of the 17th Annual ACM Symposium on Theory of Computing, Providence, Rhode Island, 1985, 213–216.
L. Carroll: Lawn tennis tournaments,St. James's Gazette, pages 5–6, August 1883, Reprinited in “The complete stories of Lewis Carrol”, Magpie Books Ltd., London, 1993, 775–782.
W. Cunto andJ.I. Munro: Average case selection,Journal of the ACM,36 (2) (1989), 270–279.
D. Dor andU. Zwick: Selecting the median, InProceedings of the 6rd Annual ACM-SIAM Symposium on Discrete Algorithms, 1995, 28–37.
R.W. Floyd andR.L. Rivest: Expected time bounds for selection,Communication of the ACM,18 (1975), 165–173.
A. Hadian andM. Sobel: Selecting thet-th largest using binary errorless comparisons,Colloquia Mathematica Societatis János Bolyai,4 (1969), 585–599.
J.W. John: A new lower bound for the set-partition problem,SIAM Journal on Computing,17 (4) (1988), 640–647.
S.S. Kislitsyn: On the selection of thek-th element of an ordered set by pairwise comparisons,Sibirsk. Mat. Zh.,5 (1964), 557–564.
Donald E. Knuth:Sorting and searching, Volume 3 ofThe art of computer programming, Addison-Wesley, 1973.
T. Motoki: A note on upper bounds for selection problems,Information Processing Letters,15 (5) (1982), 214–219.
P.V. Ramanan andL. Hyafil: New algorithms for selection,Journal of Algorithms,5 (1984), 557–578.
J. Schreier: On tournament elimination systems,Mathesis Polska,7 (1932), 154–160. (in Polish).
A. Schönhage, M. Paterson, andN. Pippenger: Finding the median,Journal of Computer and System Sciences,13 (1976), 184–199.
F. Yao: On lower bounds for selection problems, Technical Report MAC TR-121, Mass. Inst. of Technology, 1974.
C.K. Yap: New upper bounds for selection,Communication of the ACM,19 (9) (1976), 501–508.