论文信息 - The limiting distribution for the number of symbol comparisons used by QuickSort is nondegenerate (extended abstract)

The limiting distribution for the number of symbol comparisons used by QuickSort is nondegenerate (extended abstract)

In a continuous-time setting, Fill (2010) proved, for a large class of probabilistic sources, that the number of symbol comparisons used by QuickSort, when centered by subtracting the mean and scaled by dividing by time, has a limiting distribution, but proved little about that limiting random variable Y -- not even that it is nondegenerate. We establish the nondegeneracy of Y. The proof is perhaps surprisingly difficult.

James Allen Fill | Patrick Bindjeme

[1] Kai Lai Chung,et al. A Course in Probability Theory , 1949 .

[2] Svante Janson,et al. The number of bit comparisons used by Quicksort: an average-case analysis , 2004, SODA '04.

[3] J. Vogelstein. Department of Applied Mathematics and Statistics , 2022 .

[4] Svante Janson,et al. Quicksort asymptotics , 2002, J. Algorithms.

[5] Sartaj Sahni,et al. Analysis of algorithms , 2000, Random Struct. Algorithms.

[6] James Allen Fill,et al. Distributional Convergence for the Number of Symbol Comparisons Used by Quickselect , 2012, Advances in Applied Probability.

[7] A. M. Fink,et al. On Chebyshev's other inequality , 1984 .