A simpler analysis of algorithm 65 (find)

We present a simpler analysis of the expected number of comparisons made by Hoare's selection algorithm (Comm. ACM4 (1961), pp. 321--322).

[1]  C. A. R. Hoare.  Algorithm 63: partition , 1961, CACM.

[2]  Manuel Blum,et al.  Time Bounds for Selection , 1973, J. Comput. Syst. Sci..

[3]  Alfred V. Aho,et al.  Data Structures and Algorithms , 1983 .

[4]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[5]  Donald E. Knuth,et al.  Sorting and Searching , 1973 .

[6]  Cecilia R. Aragon,et al.  Randomized search trees , 1989, 30th Annual Symposium on Foundations of Computer Science.

[7]  Donald E. Knuth,et al.  The art of computer programming: sorting and searching (volume 3) , 1973 .