Perfect simulation from the Quicksort limit distribution
Probability
2007-05-23 v2 Data Structures and Algorithms
Abstract
The weak limit of the normalized number of comparisons needed by the Quicksort algorithm to sort n randomly permuted items is known to be determined implicitly by a distributional fixed-point equation. We give an algorithm for perfect random variate generation from this distribution.
Cite
@article{arxiv.math/0005237,
title = {Perfect simulation from the Quicksort limit distribution},
author = {Luc Devroye and James Allen Fill and Ralph Neininger},
journal= {arXiv preprint arXiv:math/0005237},
year = {2007}
}
Comments
7 pages. See also http://www.mts.jhu.edu/~fill/, http://www-cgrl.cs.mcgill.ca/~luc/, and http://www.stochastik.uni-freiburg.de/homepages/neininger/ . Submitted for publication in May, 2000