| |
| | select.nw (Site not responding. Last check: 2007-10-19) |
 | | An efficient implementation of Blum, Floyd, Pratt, Rivest, and Tarjan's worst-case linear selection algorithm |
 | | In 1973, Manuel Blum, Robert W. Floyd, Vaughan Pratt, Ronald L. |
 | | Rivest, and Robert E. Tarjan wrote a paper entitled Time bounds for selection which explored the problem of selecting the kth smallest element in an array, and demonstrated an explicit algorithm for solving it in worst-case O(n) time, using only comparisons. |
| moonflare.com /code/select/select.html (1506 words) |
|