A note concerning the limit distribution of the quicksort algorithm

Theoretical Informatics and Applications

Volumn 30, Issue 3, 1996, Pages 195-207

  Cramer, Michael ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION;

BINARY SEARCH TREE; LIMIT DISTRIBUTION; LOGNORMAL DISTRIBUTION; STATISTICAL MOMENT;

ALGORITHMS;

EID: 0030370296     PISSN: 09883754     EISSN: 28047346     Source Type: Journal    
DOI: 10.1051/ita/1996300301951     Document Type: Article

References (8)

1. P. BILLINGSLEY, Probability and Measure, Wiley, New York, 1986.
2. W. FELLER, An Introduction to Probability Theory and its Applications. Vol. II. Wiley, New York, 1957.
3. I. S. GRADSHTEYN and I. M. RYZHIK, Table of Integrals, Series and Products, Academic Press, New York, 1965.
4. P. HENNEQUIN, Combinatorial Analysis of Quicksort Algorithm, Informatique Théorique et Applications, 1989, 23, pp. 317-333.
5. C. A. R. HOARE, Quicksort, Computer Journal, 1962, 5, pp. 10-15.
6. N. L. JOHNSON and S. KOTZ, Continuous univariate distributions - I, Houghton Mifflin, Boston, 1970.
7. M. RÉGNIER, A Limiting Distribution of Quicksort, Informatique Théorique et Applications, 1989, 23, pp. 335-343.
8. U. ROSLER, A Limit Theorem for Quicksort, Informatique Théorique et Applications. 1991, 25, 85-100.