partial_sort (STL/CLR)

Arranges a specified number of the smaller elements in a range into a nondescending order or according to an ordering criterion specified by a binary predicate.

template<class _RanIt> inline
    void partial_sort(_RanIt _First, _RanIt _Mid, _RanIt _Last);
template<class _RanIt, class _Pr> inline
    void partial_sort(_RanIt _First, _RanIt _Mid, _RanIt _Last,
        _Pr _Pred);

Remarks

This function behaves the same as the STL function partial_sort. For more information, see partial_sort.

Requirements

Header: <cliext/algorithm>

Namespace: cliext

See Also

Concepts

algorithm (STL/CLR)