A note on multipivot Quicksort
Data Structures and Algorithms
2018-09-05 v3 Combinatorics
Abstract
We analyse a generalisation of the Quicksort algorithm, where k uniformly at random chosen pivots are used for partitioning an array of n distinct keys. Specifically, the expected cost of this scheme is obtained, under the assumption of linearity of the cost needed for the partition process. The integration constants of the expected cost are computed using Vandermonde matrices.
Keywords
Cite
@article{arxiv.1407.7459,
title = {A note on multipivot Quicksort},
author = {Vasileios Iliopoulos},
journal= {arXiv preprint arXiv:1407.7459},
year = {2018}
}
Comments
Author's accepted manuscript, 7 pages