Table of Contents
Previous Section Next Section

stable_sort

template <class RandIter>    void stable_sort(RandIter start, RandIter end);
template <class RandIter, class Comp>
    void stable_sort(RandIter start, RandIter end, Comp cmpfn);

The stable_sort( ) algorithm sorts the range specified by start and end. The sort is stable. This means that equal elements are not rearranged.

The second form allows you to specify a comparison function that determines when one element is less than another.


Table of Contents
Previous Section Next Section