Affiliation:
1. Yale Univ., New Haven, CT
Abstract
The worst-case, minimum number of comparisons complexity V
i
(n) of the i-th selection problem is considered. A new upper bound for V
i
(n) improves the bound given by the standard Hadian-Sobel algorithm by a generalization of the Kirkpatrick-Hadian-Sobel algorithm, and extends Kirkpatrick's method to a much wider range of application. This generalization compares favorably with a recent algorithm by Hyafil.
Publisher
Association for Computing Machinery (ACM)
Reference17 articles.
1. Linear time bounds for median computations
2. Dodgson C.L. St. James Gazette 5-6 1 August 1883. Dodgson C.L. St. James Gazette 5-6 1 August 1883.
3. Expected time bounds for selection
4. On the selection of the kth element of an ordered set by pairwise comparisons;Kislitsyn S.S;Sibirsk. Mat. Zh.,1964
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Finding a mediocre player;Discrete Applied Mathematics;2021-04
2. Selection Algorithms with Small Groups;International Journal of Foundations of Computer Science;2020-04
3. A Selectable Sloppy Heap;Algorithms;2019-03-06
4. Finding a Mediocre Player;Lecture Notes in Computer Science;2019
5. On partial sorting in restricted rounds;Acta Universitatis Sapientiae, Informatica;2017-07-26