Approximating the limiting Quicksort distribution

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

[1]  Svante Janson,et al.  Smoothness and decay properties of the limiting Quicksort density function , 2000, ArXiv.

[2]  G. Simons,et al.  Inequalities for Ek(X, Y) when the marginals are fixed , 1976 .

[3]  Mireille Régnier.  A Limiting Distribution for Quicksort , 1989, RAIRO Theor. Informatics Appl..

[4]  H. Montgomery.  Ten lectures on the interface between analytic number theory and harmonic analysis , 1994 .

[5]  U. Rösler.  A limit theorem for "Quicksort" , 1991, RAIRO Theor. Informatics Appl..

[6]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[7]  W. Rudin.  Real and complex analysis , 1968 .

[8]  William F. Eddy,et al.  How Many Comparisons Does Quicksort Use? , 1995, J. Algorithms.

[9]  Wojciech Szpankowski,et al.  Quicksort Algorithm Again Revisited , 1999, Discret. Math. Theor. Comput. Sci..

[10]  Joseph JáJá.  A perspective on Quicksort , 2000, Comput. Sci. Eng..

[11]  Jack J. Dongarra,et al.  Guest Editors Introduction to the top 10 algorithms , 2000, Comput. Sci. Eng..

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

[13]  P. Hadjicostas,et al.  Some properties of a limiting distribution in Quicksort , 1995 .

[14]  Svante Janson,et al.  A characterization of the set of fixed points of the Quicksort transformation , 2000, ArXiv.

[15]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[16]  L. Schwartz.  Théorie des distributions , 1966 .

[17]  M. V. Wilkes,et al.  The Art of Computer Programming, Volume 3, Sorting and Searching , 1974 .

[18]  Donald E. Knuth,et al.  The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .