Abstract
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.
Keywords
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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
R. W. Floyd and R. L. Rivest. Expected time bounds for selection. Communications of the ACM, 18:165–172, 1975.
L. R. Ford and S. M. Johnson. A tournament problem. American Mathematical Monthly, 66:387–389, 1959.
E. Horowitz and S. Sahni. Fundamentals of Computer Algorithms, pages 131–135. Computer Science Press, 1978.
T. W. Lai. Space Bounds for Selection. Master's thesis, University of Waterloo, 1987.
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.
J. I. Munro and H. Suwanda. Implicit data structures for fast search and update. Journal of Computer and System Sciences, 21:236–250, 1980.
A. Schönhage, M. Paterson, and N. Pippenger. Finding the median. Journal of Computer and System Sciences, 13:184–199, 1976.
J. van Leeuwen and D. Wood. Interval heaps. Technical Report, Univ. of Waterloo, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lai, T.W., Wood, D. (1988). Implicit selection. In: Karlsson, R., Lingas, A. (eds) SWAT 88. SWAT 1988. Lecture Notes in Computer Science, vol 318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19487-8_2
Download citation
DOI: https://doi.org/10.1007/3-540-19487-8_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19487-3
Online ISBN: 978-3-540-39288-0
eBook Packages: Springer Book Archive