Perfect simulation from the Quicksort limit distribution
<|reference_start|>Perfect simulation from the Quicksort limit distribution: 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.<|reference_end|>
@article{devroye2000perfect,
    title={Perfect simulation from the Quicksort limit distribution},
    author={Luc Devroye (McGill Univ.), James Allen Fill (Johns Hopkins Univ.),
  Ralph Neininger (Univ. Freiburg)},
    journal={arXiv preprint arXiv:math/0005237},
    year={2000},
    number={603, Department of Mathematical Sciences, The Johns Hopkins
  University},
    archivePrefix={arXiv},
    eprint={math/0005237},
    primaryClass={math.PR cs.DS}
}