Randomized Selection with Tripartitioning

19 stron ; 21 cm

Bibliography p. 16,18-19-0

19 pages ; 21 cm

Bibliografia s. 16,18-19-0

It has been shown 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, even when equal elements occur. This parallels our recent analysis of another variant due to Floyd and Rivest. The obtained results suggest that both variants perform well in practice, and may compete with other selection methods, such as Hoare’s FIND or quickselect with median-of-3 pivots.