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.
Cite
CITATION STYLE
Lai, T. W., & Wood, D. (1988). Implicit selection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 318 LNCS, pp. 14–23). Springer Verlag. https://doi.org/10.1007/3-540-19487-8_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
