Expected time bounds for selection
- 1 March 1975
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 18 (3), 165-172
- https://doi.org/10.1145/360680.360691
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Algorithm 489: the algorithm SELECT—for finding the i th smallest of n elements [M1]Communications of the ACM, 1975
- Time bounds for selectionJournal of Computer and System Sciences, 1973
- Algorithms: Algorithm 333: MINIT algorithm for linear programmingCommunications of the ACM, 1968
- Algorithm 63: partitionCommunications of the ACM, 1961