Skip to main content
Conference ProceedingsOPEN ACCESS

FINDING THE MEDIAN REQUIRES 2n COMPARISONS.

Conference Proceedings of the Annual ACM Symposium on Theory of Computing (1985) 213-216
DOI: 10.1145/22145.22169
35Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.

Abstract

A long-standing problem in the analysis of algorithms is to determine the number of comparisons needed to find the t-th largest element in a totally ordered universe of size n. Finding the median is a special case of this problem. The authors review some previous results and then use some simple techniques to strengthen one of these results, obtaining an improved lower bound for the problem.

Cite

CITATION STYLE

APA

Bent, S. W., & John, J. W. (1985). FINDING THE MEDIAN REQUIRES 2n COMPARISONS. In Conference Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 213–216). ACM (Order n 508850). https://doi.org/10.1145/22145.22169

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free