Approximating the limiting quicksort distribution

Random Structures and Algorithms

Volumn 19, Issue 3-4, 2001, Pages 376-406

  Fill, James Allen ^a   Janson, Svante ^b  

^a JOHNS HOPKINS UNIVERSITY   (United States)

^b UPPSALA UNIVERSITY   (Sweden)

Author keywords

Characteristics function; Coupling; dp metric; Density; Fourier analysis; Integral equation; Kolmogorov Smirnov distance; Moment generation function; Numerical analysis; Quicksort; Sorting algorithim; Total variation distance

Indexed keywords

EID: 85047698982     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10007     Document Type: Article

References (18)

1. S. Cambanis, G. Simons, and W. Stout, Inequalities for Ek(X, Y) when the marginals are fixed, Z. Wahrscheinlichkeitstheorie verw, Gebiete 36 (1976), 285-294.
2. J.G. van der Corput, Zahlentheoretische Abschätzungen, Math Ann 84 (1921), 53-79.
3. J. Dongarra and F. Sullivan, Guest editors' introduction: The top 10 algorithms, Comput Sci Eng 2 (2000).
4. W.F. Eddy and M.J. Schervish, How many comparisons does Quicksort use? J Algorithms 19 (1995), 402-431.
5. W. Feller, An introduction to probability theory and its applications, 2nd ed., Wiley, New York. 1971. Vol. II.
6. J.A. Fill and S. Janson, “Smoothness and decay properties of the limiting Quicksort density function," Mathematics and computer science: Algorithms, trees, combinatorics and probabilities, D. Gardy and A. Mokkadem (Editors), Trends in mathematics, Birkhäuser Verlag, 2000, pp. 53-64. Refereed article, available from http://www.mts.jhu.edu/˜fill/ or http://www.math.uu.se/˜svante/.
7. J.A. Fill and S. Janson, A characterization of the set of fixed points of the Quicksort transformation, Electron Comm Probab 5 (2000), 77-84 (electronic).
8. J.A. Fill and S. Janson, Quicksort asymptotics. Technical Report #597, Department of Mathematical Sciences, The Johns Hopkins University. Preprint available from http://www.mts.jhu.edu/˜fill/ or http://www.math.uu.se/˜svante/.
9. C.A.R. Hoare, Quicksort, Comput J 5 (1962), 10-15.
10. J. JaJa, A perspective on quicksort, Comput Sci Eng 2 (2000).
11. C. Knessl and W. Szpankowski, Quicksort algorithm again revisited, Discrete Math Theor Comput Sci 3 (1999), 43-64.
12. D.E. Knuth, The art of computer programming. Vol. 3. Sorting and searching. 2nd ed., Addison-Wesley, Reading, MA, 1998, Vol. 3.
13. H.L. Montgomery, Ten lectures on the interface between analytic number theory and harmonic analysis, CBMS Reg Conf Ser Math 84, AMS, Providence, RI, 1994.
14. M. Régnier, A limiting distribution for quicksort, RAIRO Inform Théor Appl 23 (1989), 335-343.
15. U. Rösier, A limit theorem for 'Quicksort', RAIRO Inform Théor Appl 25 (1991), 85-100.
16. W. Rudin, Real and complex analysis, 2nd ed., McGraw-Hill, New York, 1974.
17. L. Schwartz, Théorie des distributions, 2nd ed., Hermann, Paris, 1966.
18. K.H. Tan and P. Hadjicostas, Some properties of a limiting distribution in Quicksort, Statist Probab Lett 25 (1995), 87-94.