Finding the median requires 2n comparisons
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Principles of artificial intelligence
Principles of artificial intelligence
A new lower bound for the set-partitioning problem
SIAM Journal on Computing
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A Counting Approach to Lower Bounds for Selection Problems
Journal of the ACM (JACM)
A Unified Lower Bound for Selection and Set Partitioning Problems
Journal of the ACM (JACM)
The complexity of selection problems (algorithms, lower bound, decision trees, adversary)
The complexity of selection problems (algorithms, lower bound, decision trees, adversary)
Optimal selection and sorting via dynamic programming
Journal of Experimental Algorithmics (JEA)
| Hi-index | 0.00 |
A classic problem in computer science is selection: given a list of n numbers, find the ith largest, using the fewest number of comparisons. We are interested in the exact number of comparisons required for specific small values of i and n. We have written a program that can be used either to find the exact number of comparisons for very low values of i and n, or to find upper bounds on the number of comparisons for slightly larger values of i and n. In some cases we have improved on the results in the literature and have additional improvements contingent on a conjecture.