Analysis of quickselect : an algorithm for order statistics

Hosam M. Mahmoud; Reza Modarres; Robert T. Smythe

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

  • Volume: 29, Issue: 4, page 255-276
  • ISSN: 0988-3754

How to cite

top

Mahmoud, Hosam M., Modarres, Reza, and Smythe, Robert T.. "Analysis of quickselect : an algorithm for order statistics." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 29.4 (1995): 255-276. <http://eudml.org/doc/92508>.

@article{Mahmoud1995,
author = {Mahmoud, Hosam M., Modarres, Reza, Smythe, Robert T.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {sorting; QUICKSELECT; QUICKSORT},
language = {eng},
number = {4},
pages = {255-276},
publisher = {EDP-Sciences},
title = {Analysis of quickselect : an algorithm for order statistics},
url = {http://eudml.org/doc/92508},
volume = {29},
year = {1995},
}

TY - JOUR
AU - Mahmoud, Hosam M.
AU - Modarres, Reza
AU - Smythe, Robert T.
TI - Analysis of quickselect : an algorithm for order statistics
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1995
PB - EDP-Sciences
VL - 29
IS - 4
SP - 255
EP - 276
LA - eng
KW - sorting; QUICKSELECT; QUICKSORT
UR - http://eudml.org/doc/92508
ER -

References

top
  1. 1. G. BRASSARD and P. BRATLEY, Algorithms: Theory and Practice, Prentice-Hall, Englewoord Cliffs, New Jersey, 1988. Zbl0643.68003MR1013783
  2. 2. S. CAMBANIS, G. SIMONS and W. STOUT, Inequalities for the expected value of K (x, y) when the marginals are fîxed, Zeit Wahrsch. Verw. Geb., 1976, 36, pp. 285-294. Zbl0325.60002MR420778
  3. 3. H. CHERNOFF, A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations, Annals of Mathematical Statistics, 1952, 23, pp. 493-507. Zbl0048.11804MR57518
  4. 4. Y. CHOW and H. TEICHER, Probability Theory, Springer Verlag, New York, 1978. Zbl0399.60001MR513230
  5. 5. K. CHUNG, A Course in Probability Theory, Second Edition, Academic Press, Orlando, Florida, 1974. MR346858
  6. 6. L. DEVROYE, Exponential bounds for the running time of a selection algorithm, Journal of Computer and System Sciences, 1984, 29, pp. 1-7. Zbl0555.68018MR761047
  7. 7. G. GONNET and R. BAEZA-YATES, Handbook of Algorithms and Data Structures in Pascal and C, Second Edition, Addison-Wesley, Reading, Massachusetts, 1991. Zbl0719.68001
  8. 8. P. HENNEQUIN, Combinatorial Analysis of Quicksort Algorithm, RAIRO, Theoretical Informatics and Applications, 1989, 23, pp. 317-333. Zbl0685.68058MR1020477
  9. 9. C. HOARE, Find (Algorithm 65), Communications of the ACM, 1961, 4, pp. 321-322. 
  10. 10. C. HOARE, Quicksort, The Computer Journal, 1962, 5, pp. 10-15. Zbl0108.13601MR142216
  11. 11. D. KNUTH, The Art of Computer Programming, 3: Sorting and Searching, Addison-Wesley, Reading, Massachussetts, 1973. Zbl0302.68010MR378456
  12. 12. R. KRUISE, Data Structures and Program Design, Second Edition, Prentice-Hall, Englewood Cliffs, New Jersey, 1987. 
  13. 13. E. LEHMANN, Nonparametrics: Statistical Methods Based on Ranks, Holden-Day, San Francisco/McGraw-Hill, New York, 1975. Zbl0354.62038MR395032
  14. 14. H. MAHMOUD, Evolution of Rondom Search Trees, John Wiley, New York, 1992. Zbl0762.68033
  15. 15. H. MAHMOUD, A law of large numbers for path lengths in search trees, Chapter in Random Graphs: Vol. II, A. FRIEZE and TOMASZ LUCZAK, eds., John Wiley, New York, 1992. Zbl0825.68491MR1166615
  16. 16. M. RÉGNIER, A limiting distribution for Quicksort, RAIRO, Theoretical Informatics and Applications, 1989, 23, pp. 335-343. Zbl0677.68072MR1020478
  17. 17. U. RÖSLER, A limit theorem for "QUICKSORT", RAIRO, Theoretical Informatics and Applications, 1991, 25, pp. 85-100. Zbl0718.68026MR1104413
  18. 18. R. SEDGEWICK, Quicksort with equal keys, SIAM J. on Computing, 1977, 6, pp. 240-267. Zbl0356.68053MR449004
  19. 19. R. SEDGEWICK, The analysis of quicksort programs, Acta Informatica, 1977, 7, pp. 327-355. Zbl0325.68016MR451845
  20. 20. R. SEDGEWICK, Quicksort, Garland, New York, 1980. 
  21. 21. R. SEDGEWICK, Algorithms, Second edition, Addison-Wesley, Reading, Massachusetts, 1988. Zbl0529.68002

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.