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},
     mrnumber = {1020477},
     zbl = {0685.68058},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1989__23_3_317_0/}
}
TY  - JOUR
AU  - Hennequin, P.
TI  - Combinatorial analysis of quicksort algorithm
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1989
SP  - 317
EP  - 333
VL  - 23
IS  - 3
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1989__23_3_317_0/
LA  - en
ID  - ITA_1989__23_3_317_0
ER  - 
%0 Journal Article
%A Hennequin, P.
%T Combinatorial analysis of quicksort algorithm
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1989
%P 317-333
%V 23
%N 3
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_1989__23_3_317_0/
%G en
%F 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 | Zbl

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

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

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 | Zbl

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

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

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

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