Average-case analysis of multiple Quickselect: An algorithm for finding order statistics

Statistics and Probability Letters

Volumn 28, Issue 4, 1996, Pages 299-310

  Lent, Janice ^a   Mahmoud, Hosam M ^a  

^a GEORGE WASHINGTON UNIVERSITY   (United States)

Author keywords

Analysis of algorithms; Random binary search tree; Selection of order statistics; Sorting

Indexed keywords

EID: 0030210371     PISSN: 01677152     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-7152(95)00139-5     Document Type: Article

References (19)

1. Arora, S. and M. Dent (1969), Randomized binary search technique, Comm. ACM, 12, 77-80.
2. Devroye, L. (1991), Limit laws for local counters in random binary search trees, Random Structures Algorithms, 2, 303-315.
3. Eddy, W. and M. Schervish (1995), How many comparisons does Quicksort use? J. Algorithms, 19, 402-431.
4. Floyd, R. and R. Rivest (1975), Algorithm 489, Comm. ACM 18, 173.
5. Gastwirth, J. and M. Cohen (1970), Small sample behavior of robust linear estimators of location, J. American Statistical Association, 65, 946-973.
6. Geertsema, J. (1970), Sequential confidence intervals based on rank tests, Ann. Math. Statist. 41, 1016-1026.
7. Hennequin, P. (1987), Combinatorial analysis of quicksort algorithm, RAIRO Theoret. Inform. Appl. 23, 317-333.
8. Hennequin, P. (1991), Analyse en moyenne d'algorithmes, tri rapide et arbres de recherche, Ph.D. Thesis, L'École polytechnique Palaiseau.
9. Hoare, C. (1962), Quicksort, Comput. J. 5, 10-15.
10. Knuth, D. (1973), The Art of Computer Programming, Vol. 3: Sorting and Searching. (Addison-Wesley, Reading, MA).
11. Lent, J. and R. Modarres (1995), An algorithm for simultaneous selection of order statistics (presented at the 1995 Joint Statistical Meetings).
12. Mahmoud, H. (1992), Evolution of Random Search Trees (Wiley, New York).
13. Mahmoud, H., R. Modarres and R. Smythe (1995), Analysis of quickselect: an algorithm for order statistics, RAIRO, Theoret. Inform. Appl. 29, 255-276.
14. Régnier, M. (1989), A limiting distribution for quicksort, RAIRO, Theoret. Inform. Appl. 23, 335-343.
15. Rössler, U. (1991), A limit theorem for QUICKSORT, RAIRO, Theoret. Inform. Appl. 25, 85-100.
16. Sedgewick, R. (1988), Algorithms (Addison-Wesley, Reading, MA, 2nd ed.).
17. Serfling, R. (1980), Approximation Theories of Mathematical Statistics (Wiley, New York).
18. Tan, K. and P. Hadjicostas (1995), Some properties of a limiting distribution in Quicksort, Statist. Prohab. Lett. 25, 87-94.
19. Wilks, S. (1962), Mathematical Statistics (Wiley, New York).