Comparisons in Hoare's Find Algorithm

Combinatorics Probability and Computing

Volumn 7, Issue 1, 1998, Pages 111-120

  Kirschenhofer, Peter ^a   Prodinger, Helmut ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032358895     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548397003325     Document Type: Review

References (15)

1. Abramowitz, M. and Stegun, I. A. (1973) Handbook of Mathematical Functions. Dover. (Reprint of the Tenth National Bureau of Standards edition, 1964.)
2. Arora, S. and Dent, W. (1969) Randomized binary search technique. Comm. ACM 12 77-80.
3. Graham, R. L., Knuth, D. E. and Patashnik, O. (1989) Concrete Mathematics. Addison-Wesley.
4. Greene, D. H. and Knuth, D. E. (1982) Mathematics for the Analysis of Algorithms. Birkhäuser.
5. Hoare, C. A. R. (1961) Find (Algorithm 65). Comm. ACM 4 321-322.
6. Hoare, C. A. R. (1962) Quicksort. Computer J. 5 10-15.
7. Hwang, H.-K. (1990) On the average shape of binary search trees. Unpublished manuscript.
8. Kirschenhofer, P., Martínez, C. and Prodinger, H. (1997) Analysis of Hoare's Find algorithm with median-of-three partition. Random Structures and Algorithms 10 143-156.
9. Knuth, D. E. (1968) The Art of Computer Programming: volume 1: Fundamental Algorithms. Addison-Wesley. (2nd ed. 1973.)
10. Knuth, D. E. (1972) Mathematical analysis of algorithms. In Information Processing 71, pp. 19-27. North-Holland.
11. Knuth, D. E. (1973) The Art of Computer Programming: volume 3: Sorting and Searching. Addison-Wesley.
12. Lent, J. and Mahmoud, H. M. (1996) Average-case analysis of multiple quickselect: An algorithm for finding order statistics. Statistics and Probability Letters 28 299-310.
13. Mahmoud, H. M. (1992) Evolution of Random Search Trees. John Wiley, New York.
14. Mahmoud, H. M., Modarres, R. M. and Smythe, R. T. (1995) Analysis of one-sided quicksort: An algorithm for order statistics. RAIRO, Theoretical Informatics and Applications 29 255-276.
15. Prodinger, H. (1995) Multiple quickselect - Hoare's Find algorithm for several elements. Information Processing Letters 56 123-129.