Combinatorial analysis of quicksort algorithm
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 23 (1989) no. 3, pp. 317-333.
@article{ITA_1989__23_3_317_0,
     author = {Hennequin, P.},
     title = {Combinatorial analysis of quicksort algorithm},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {317--333},
     publisher = {EDP-Sciences},
     volume = {23},
     number = {3},
     year = {1989},
     zbl = {0685.68058},
     mrnumber = {1020477},
     language = {en},
     url = {www.numdam.org/item/ITA_1989__23_3_317_0/}
}
Hennequin, P. Combinatorial analysis of quicksort algorithm. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 23 (1989) no. 3, pp. 317-333. http://www.numdam.org/item/ITA_1989__23_3_317_0/

1 A. V. Aho, J. E. Hopcroft and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison Wesley, Reading, 1974. | MR 413592 | Zbl 0326.68005

2 L. Comtet, Analyse Combinatoire, P.U.F., Paris, 1970. | Zbl 0221.05002

3 P. Flajolet, Mathematical Analysis of Algorithms and Data Structures, I.N.R.I.A., Res. Rep., Vol. 400, 1985.

4 P. Flajolet and C. Puech, Partial match retrieval of multidimensional data, J.A.C.M. 33, Vol. 2, 1986, pp.371-407. | MR 835110

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. | MR 505546 | Zbl 0325.05007

6 D. H. Greene, Labelled Formal Languages and Their Uses, Ph. D. Thesis, 1983.

7 D. E. Knuth, The Art of Computer Programming, Vol. 1: Fundamental Algorithms, Vol. 3, Sorting and searching, Addison Wesley, Reading, 1968, 1973. | MR 378456

8 M. Regnier, A limiting Distribution for Quicksort, RAIRO, Th. Informatics and Applications (to appear). | Numdam | MR 1020478 | Zbl 0677.68072

9 R. Sedgewick, Quicksort, Garland pub. co., New York, 1980.

10 J. M. Steyaert, Complexité et structure des algorithmes, Thesis Paris, 1984.