Most selection algorithms are also in-place, although some considerably rearrange the input array in the process of finding the final, constant-sized result.

A selection algorithm chooses the kth smallest of a list of numbers; this is an easier problem in general than sorting.

A variation on this algorithm brings the worst-case time down to O(n) (see selection algorithm for more information).

So here's how simple the selection algorithm could be on any prospective computer program: 'Earns/has savings more than x - benefit denied.'

IEEE 1588-2008 uses a hierarchical selection algorithm based on the following properties in the order indicated.

IEEE 1588-2002 uses a selection algorithm based on similar properties.

The selection algorithms evaluate components of random sets of solutions to a problem.

There are O(n), worst-case linear time, selection algorithms.

One of the simplest examples is the selection algorithm.

In such circumstances many of the standard threshold selection algorithms will fail.