Combinatorial analysis of quicksort algorithm

P. Hennequin

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1989)

  • Volume: 23, Issue: 3, page 317-333
  • ISSN: 0988-3754

How to cite

top

Hennequin, P.. "Combinatorial analysis of quicksort algorithm." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 23.3 (1989): 317-333. <http://eudml.org/doc/92337>.

@article{Hennequin1989,
author = {Hennequin, P.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {average computing time; higher moments of computing; QUICKSORT; sorting},
language = {eng},
number = {3},
pages = {317-333},
publisher = {EDP-Sciences},
title = {Combinatorial analysis of quicksort algorithm},
url = {http://eudml.org/doc/92337},
volume = {23},
year = {1989},
}

TY - JOUR
AU - Hennequin, P.
TI - Combinatorial analysis of quicksort algorithm
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1989
PB - EDP-Sciences
VL - 23
IS - 3
SP - 317
EP - 333
LA - eng
KW - average computing time; higher moments of computing; QUICKSORT; sorting
UR - http://eudml.org/doc/92337
ER -

References

top
  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. 

NotesEmbed ?

top

You must be logged in to post comments.