Year: 2001
Type: article
Abstract: The limiting distribution of the normalized number of comparisons used by Quicksort to sort an array of n numbers is known to be the unique fixed point with zero mean of a certain distributional transformation S. We study the convergence to the limiting distribution of the sequence of distributions obtained by iterating the transformation S, beginning with a (nearly) arbitrary starting distribution. We demonstrate geometrically fast convergence for various metrics and discuss some implications for numerical calculations of the limiting Quicksort distribution. Finally, we give companion lower bounds which show that the convergence is not faster than geometric. © 2001 John Wiley & Sons, Inc. Random Struct. Alg., 19: 376–406, 2001
Source: Random Structures and Algorithms
DOI: 10.1002/rsa.10007
Authors: James Allen Fill, Svante Janson
Institutions: Johns Hopkins University, Uppsala University
Language: English
Subfield: Statistics and Probability
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Funder: National Science Foundation
OpenAlex ID: W2046684090
