An algorithm for the selection problem

A refinement to a well‐known selection algorithm is described. The refinement results in a useful improvement in the performance of the original algorithm, particularly when the selection index is small relative to the median.

[1]  Donald E. Knuth,et al.  Mathematical Analysis of Algorithms , 1971, IFIP Congress.

[2]  Ronald L. Rivest,et al.  Expected time bounds for selection , 1975, Commun. ACM.