Variance of the number of Comparisons of Randomized Quicksort
Probability
2010-06-22 v1
Abstract
This paper gives a straightforward self-contained proof of the formula for the variance of the number of comparisons used by the Quicksort sorting algorithm when pivots are chosen uniformly at random. The result has been known for some time but we had not found a single source giving all details of the argument in a self-contained and explicit way. We hope these details may be of interest to students and others wishing to understand this calculation. No originality is claimed for the result.
Cite
@article{arxiv.1006.4063,
title = {Variance of the number of Comparisons of Randomized Quicksort},
author = {Vasileios Iliopoulos and David Penman},
journal= {arXiv preprint arXiv:1006.4063},
year = {2010}
}
Comments
20 pages. We do not intend to submit this elsewhere