One may generalize the selection problem to apply to ranges within a list, yielding the problem of range queries.
algorithm | RSA (algorithm) | Secure Hash Algorithm | Schönhage–Strassen algorithm | Luhn algorithm | Earley's Algorithm | Dijkstra's algorithm | CYK algorithm | Viterbi algorithm | Prim's algorithm | Levenberg–Marquardt algorithm | Kosaraju's algorithm | Yarrow algorithm | sorting algorithm | selection | Root-finding algorithm | Kruskal's algorithm | group selection | Generic Security Service Algorithm for Secret Key Transaction | Digital Signature Algorithm | Cayley–Purser algorithm | Blahut–Arimoto algorithm | Bellman–Ford algorithm | Appeals Selection Committee of the Supreme Court of Norway | Algorithm | Winner-take-all in action selection | Verhoeff algorithm | Vatti clipping algorithm | The Selection | The Descent of Man, and Selection in Relation to Sex |
Like quicksort, it was developed by Tony Hoare, and thus is also known as Hoare's selection algorithm.