Analysis of Hoare's FIND Algorithm with Median-of-Three Partition

Random Structures and Algorithms

Volumn 10, Issue 1-2, 1997, Pages 143-156

  Kirschenhofer, P ^a   Prodinger, H ^a   Martinez C ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031540315     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(sici)1098-2418(199701/03)10:1/2<143::aid-rsa7>3.0.co;2-v     Document Type: Article

References (13)

1. D. H. Anderson and R. Brown, Combinatorial aspects of C. A. R. Hoare's Find algorithm, Australasian J. Combinat., 5, 109-119 (1992).
2. M. Blum, R. W. Floyd, V. R. Pratt, R. Rivest, and R. Tarjan, Time bounds for selection, J. Comput. Syst. Sci., 7, 448-461 (1973).
3. L. Devroye, Exponential bounds for the running time of a selection algorithm, J. Comput. Syst. Sci., 29, 1-7 (1984).
4. G. H. Gonnet and R. Baeza-Yates, Handbook of Algorithms and Data Structures - In Pascal and C, 2nd ed., Addison-Wesley, Reading, MA, 1991.
5. R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics, Addison-Wesley, Reading, MA, 1989.
6. C. A. R. Hoare, Find (Algorithm 65), Commun. ACM, 4, 321-322 (1961).
7. C. A. R. Hoare, Quicksort, Comput. J., 5, 10-15 (1962).
8. E. Kamke, Differentialgleichungen: Lösungsmethoden und Lösungen, Teubner Stuttgart 1977.
9. D. E. Knuth, Mathematical analysis of algorithms, in Information Processing '71, Proc. of the 1971 IFIP Congress, North-Holland, Amsterdam, 1972, pp. 19-27.
10. D. E. Knuth, The Art of Computer Programming: Sorting and Searching, Addison-Wesley, Reading, MA, 1973, Vol. 3.
11. H. M. Mahmoud, R. M. Modarres, and R. T. Smythe, Analysis of one-sided quicksort: an algorithm for order statistics, RAIRO Theor. Inf. Appl., 29, 255-276 (1995).
12. R. Sedgewick, Quicksort, Garland, New York, 1978.
13. M. H. van Emden, Increasing the efficiency of Quicksort, Commun. ACM, 13, 563-567 (1970).