Implicit selection

  • Tony W. Lai
  • Derick Wood
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 318)


We consider the implicit selection problem, in which we want to select the kth smallest element of a multiset of n elements using only a constant amount of additional space. We show that this problem can be solved in O(n) time in the worst case. In particular, we show that 6.7756n+o(n) comparisons are sufficient if all elements are distinct and 6.8280n+o(n) comparisons are sufficient in the general case.


Selection Algorithm Binary Search Recursive Call Extra Space Additional Space 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    S. W. Bent and J. W. John. Finding the median requires 2n comparisons. In Proceedings of the 17th Annual ACM Symposium on Theory of Computing, pages 213–216, 1985.Google Scholar
  2. [2]
    M. Blum, R. W. Floyd, V. Pratt, R. L. Rivest, and R. E. Tarjan. Time bounds for selection. Journal of Computer and System Sciences, 7:448–461, 1973.Google Scholar
  3. [3]
    R. W. Floyd and R. L. Rivest. Expected time bounds for selection. Communications of the ACM, 18:165–172, 1975.Google Scholar
  4. [4]
    L. R. Ford and S. M. Johnson. A tournament problem. American Mathematical Monthly, 66:387–389, 1959.Google Scholar
  5. [5]
    E. Horowitz and S. Sahni. Fundamentals of Computer Algorithms, pages 131–135. Computer Science Press, 1978.Google Scholar
  6. [6]
    T. W. Lai. Space Bounds for Selection. Master's thesis, University of Waterloo, 1987.Google Scholar
  7. [7]
    J. I. Munro. An implicit data structure supporting insertion, deletion, and search in O (log2 n) time. Journal of Computer and System Sciences, 33:66–74, 1986.Google Scholar
  8. [8]
    J. I. Munro and H. Suwanda. Implicit data structures for fast search and update. Journal of Computer and System Sciences, 21:236–250, 1980.Google Scholar
  9. [9]
    A. Schönhage, M. Paterson, and N. Pippenger. Finding the median. Journal of Computer and System Sciences, 13:184–199, 1976.Google Scholar
  10. [10]
    J. van Leeuwen and D. Wood. Interval heaps. Technical Report, Univ. of Waterloo, 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Tony W. Lai
    • 1
  • Derick Wood
    • 1
  1. 1.Data Structuring Group Department of Computer ScienceUniversity of WaterlooWaterlooCanada

Personalised recommendations