Partial sorting
In computer science, partial sorting is a relaxed variant of the sorting problem. If sorting is the problem of permuting a list of items such that its elements all appear in order, then partial sorting amounts to finding a permutation such that some predetermined set of indexes appear in the position of the permutation that they would have in the sorted permutation; in other words, for each requested index i, element i of the partially sorted list contains order statistic i of the input list.
See also
 | This computer science article is a stub. You can help Wikipedia by expanding it. |