Multiple Quickselect—Hoare's Find algorithm for several elements
Information Processing Letters
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A generating functions approach for the analysis of grand averages for multiple QUICKSELECT
proceedings of the eighth international conference on Random structures and algorithms
Selected papers on analysis of algorithms
Selected papers on analysis of algorithms
Communications of the ACM
Mathematics for the Analysis of Algorithms
Mathematics for the Analysis of Algorithms
Binary search tree recursions with harmonic toll functions
Journal of Computational and Applied Mathematics - Special issue: Probabilistic methods in combinatorics and combinatorial optimization
Quickselect and the Dickman Function
Combinatorics, Probability and Computing
Comparisons in Hoare's Find Algorithm
Combinatorics, Probability and Computing
Note: Moves and displacements of particular elements in Quicksort
Theoretical Computer Science
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
The analysis of Range Quickselect and related problems
Theoretical Computer Science
| Hi-index | 0.89 |
We present explicit solutions of a class of recurrences related to the Quickselect algorithm. Thus we are immediately able to solve recurrences arising at the partial sorting problem, which are contained in this class. Furthermore we show how the partial sorting problem is connected to the Multiple Quickselect algorithm and present a method for the calculation of solutions for a class of recurrences related to the Multiple Quickselect algorithm. Further an analysis of an algorithm for sorting a subarray A[r... r + p - 1], given the array A[1... n], is provided.