stable_sort (STL/CLR)

Arranges the elements in a specified range into a nondescending order or according to an ordering criterion specified by a binary predicate and preserves the relative ordering of equivalent elements.

template<class _BidIt> inline
    void stable_sort(_BidIt _First, _BidIt _Last);
template<class _BidIt, class _Pr> inline
    void stable_sort(_BidIt _First, _BidIt _Last, _Pr _Pred);

Remarks

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

Requirements

Header: <cliext/algorithm>

Namespace: cliext

See Also

Reference

algorithm (STL/CLR)