Year: 2000
Type: article
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.
DOI: 10.1214/ecp.v5-1024
Authors: Luc Devroye, James Fill, Ralph Neininger
Language: English
Subfield: Statistics and Probability
Field: Mathematics
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $675
OpenAlex ID: W2118186392
