Multiple Quickselect—Hoare's Find algorithm for several elements
Information Processing Letters
An introduction to the analysis of algorithms
An introduction to the analysis of algorithms
A generating functions approach for the analysis of grand averages for multiple QUICKSELECT
proceedings of the eighth international conference on Random structures and algorithms
Increasing the efficiency of quicksort
Communications of the ACM
Communications of the ACM
Average Case Analysis of Algorithms on Sequences
Average Case Analysis of Algorithms on Sequences
Mathematics for the Analysis of Algorithms
Mathematics for the Analysis of Algorithms
Concrete Math
Distribution of the Steiner Distance in Generalized M-ary Search Trees
Combinatorics, Probability and Computing
An efficient algorithm for partial order production
Proceedings of the forty-first annual ACM symposium on Theory of computing
Adaptive sampling strategies for quickselects
ACM Transactions on Algorithms (TALG)
An Efficient Algorithm for Partial Order Production
SIAM Journal on Computing
Towards optimal multiple selection
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
| Hi-index | 5.23 |
Multiple Quickselect is an algorithm that uses the idea of Quicksort to search for several order statistics simultaneously. In order to improve the efficiency of Quicksort, one can use the median of 2t + 1 randomly chosen elements as pivot element in the partitioning stage. Such a median of 2t + 1 partition can also be applied to Multiple Quickselect to reduce the number of comparisons. Here we give an analysis of such Multiple Quickselect variants that use median of 2t + 1 partition and describe for these algorithms the asymptotic behaviour of the expected number of required comparisons to find p-order statistics in a data set of size n for n → ∞ and fixed p.