Transitional behaviors of the average cost of quicksort with median-of-(2t+1)

Algorithmica (New York)

Volumn 29, Issue 1-2, 2001, Pages 44-69

  Chem, H H ^a   Hwang, H K ^b  

^a NATIONAL CHUNG CHENG UNIVERSITY   (Taiwan)

^b INSTITUTE OF STATISTICAL SCIENCE   (Taiwan)

Author keywords

Binary search tree; Insertion sort; Ordinary differential equation; Phase transition; Quicksort; Recurrence relations; Uniform asymptotics

Indexed keywords

ALGORITHMS; DATA STRUCTURES; DIFFERENTIAL EQUATIONS; PROBABILITY; RANDOM PROCESSES;

BINARY SEARCH TREES;

SORTING;

EID: 0003093351     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf02679613     Document Type: Article

References (29)

1. N. Bleistein and R. A. Handelsman, Asymptotic Expansions of Integrals, Dover, New York, 1985.
2. H. E. Daniels, Tail probability approximations, International Statistical Review, 55, 37-48.
3. L. Devroye, On the expected height of fringe-balanced trees, Acta Informatica, 30, 459-466, 1993.
4. P. Flajolet and A. M. Odlyzko, Singularity analysis of generating function, SIAM Journal on Discrete Mathematics, 3, 216-240, 1990.
5. G. H. Gonnet and R. Baeza-Yates, Handbook of Algorithms and Data Structures, Addison-Wesley, Reading, Massachusetts, second edition, 1991.
6. D. H. Greene, Labelled formal languages and their uses, Ph.D. Thesis, Stanford University, 1983.
7. L. J. Guibas, A principle of independence for binary tree searching, Acta Informatica, 4, 293-298, 1975.
8. P. Hennequin, Combinatorial analysis of quicksort algorithm, RAIRO Informatique théorique et Applications, 23, 317-333, 1989.
9. P. Hennequin, Analyse en moyenne d'algorithmes, tri rapide et arbres de recherche, Ph.D. Thesis, Ecole Polytechnique, 1991.
10. C. A. R. Hoare, Quicksort, Computer Journal, 5, 10-15, 1962.
11. H.-K. Hwang, A Poisson * negative binomial convolution law for random polynomials over finite fields, Random Structures and Algorithms, 13, 17-47, 1998.
12. H.-K. Hwang, Sur la repartition des valeurs des fonctions arithmétiques: le nombre de facteurs premiers d'un entier, Journal of Number Theory, 69, 135-152, 1998.
13. H.-K. Hwang, B.-Y. Yang, and Y.-N. Yeh, Presorting algorithms: an average-case point of view, Theoretical Computer Science, 242, 29-40, 2000.
14. E. L. Ince, Ordinary Differential Equations, Dover, New York, 1926.
15. D. E. Knuth, The Art of Computer Programming, Volume III: Sorting and Searching, Addison-Wesley, Reading, Massachusetts, second edition, 1998.
16. Ľ. Kollár, Optimal sorting of seven element sets, Mathematical Foundations of Computer Science (Bratislave, 1986), Lecture Notes in Computer Science, Vol. 233, No. 449-457, Springer-Verlag, Berlin, 1986.
17. R. Lugannani and S. O. Rice, Saddlepoint approximation for the distribution of the sum of independent random variables, Advances in Applied Probability, 12, 475-490, 1980.
18. H. M. Mahmoud, Evolution of Random Search Trees, Wiley, New York, 1992.
19. C. Martínez, A. Panholzer, and H. Prodinger, On the number of descendants and ascendants in random search trees, Electronic Journal on Combinatorics, 5, # R20, 1998.
20. C. Martínez and S. Roura, Optimal sampling strategies in quicksort, Automata, Languages, and Programming (Aalborg, 1998). Lecture Notes in Computer Science, Vol. 1443, pp. 327-338, Springer-Verlag, Berlin, 1998.
21. C. C. McGeoch and J. D. Tygar, Optimal sampling strategies for Quicksort, Random Structures and Algorithms, 7, 287-300, 1995.
22. A. M. Odlyzko and H. S. Wilf, Bandwidths and profiles of trees, Journal of Combinatorial Theory, Series B, 42, 348-370, 1987.
23. P. V. Poblete and J. I. Munro, The analysis of a fringe heuristic for binary search trees, Journal of Algorithms, 6, 336-350, 1985.
24. R. Sedgewick, The analysis of Quicksort programs, Acta Informatica, 7, 327-355, 1977.
25. R. Sedgewick, Quicksort, Garland, New York, 1978.
26. R. Sedgewick, Algorithms in C, Addison-Wesley, Reading, Massachusetts, third edition, 1997.
27. R. Sedgewick and P. Flajolet, An Introduction to the Analysis of Algorithms, Addison-Wesley, Reading, Massachusetts, 1996.
28. A. Walker and D. Wood, Locally balanced binary search trees, Computer Journal, 19, 322-325, 1976.
29. R. Wong, Asymptotic Approximations of Integrals, Academic Press, Boston, 1989.