Combinatorial analysis of quicksort algorithm

 Access to full text

 Full (PDF)

1. 1 A. V. AHO, J. E. HOPCROFT and J. D. ULLMAN, The Design and Analysis of Computer Algorithms, Addison Wesley, Reading, 1974. Zbl0326.68005MR413592
2. 2 L. COMTET, Analyse Combinatoire, P.U.F., Paris, 1970. Zbl0221.05002
3. 3 P. FLAJOLET, Mathematical Analysis of Algorithms and Data Structures, I.N.R.I.A., Res. Rep., Vol. 400, 1985. 
4. 4 P. FLAJOLET and C. PUECH, Partial match retrieval of multidimensional data, J.A.C.M. 33, Vol. 2, 1986, pp.371-407. MR835110
5. 5 D. FOATA, La série génératrice exponentielle dans les problèmes d'énumération, S.M.S., Montréal University Press, 1974. Zbl0325.05007MR505546
6. 6 D. H. GREENE, Labelled Formal Languages and Their Uses, Ph. D. Thesis, 1983. 
7. 7 D. E. KNUTH, The Art of Computer Programming, Vol. 1: Fundamental Algorithms, Vol. 3, Sorting and searching, Addison Wesley, Reading, 1968, 1973. Zbl0302.68010MR378456
8. 8 M. REGNIER, A limiting Distribution for Quicksort, RAIRO, Th. Informatics and Applications (to appear). Zbl0677.68072MR1020478
9. 9 R. SEDGEWICK, Quicksort, Garland pub. co., New York, 1980. 
10. 10 J. M. STEYAERT, Complexité et structure des algorithmes, Thesis Paris, 1984. 

1. Uwe Rösler, A limit theorem for “quicksort”
2. Mireille Régnier, A limiting distribution for quicksort
3. Hosam M. Mahmoud, Reza Modarres, Robert T. Smythe, Analysis of quickselect : an algorithm for order statistics
4. Michael Cramer, A note concerning the limit distribution of the quicksort algorithm