On Floyd and Rivest's SELECT algorithm

We show that several versions of Floyd and Rivest's algorithm SELECT for finding the kth smallest of n elements require at most n+min{k,n-k}+o(n) comparisons on average and with high probability. This rectifies the analysis of Floyd and Rivest, and extends it to the case of nondistinct elements. Our computational results confirm that SELECT may be the best algorithm in practice.