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.
Citation
Luc Devroye. James Fill. Ralph Neininger. "Perfect Simulation from the Quicksort Limit Distribution." Electron. Commun. Probab. 5 95 - 99, 2000. https://doi.org/10.1214/ECP.v5-1024
Information
