Name
stable_sort function template — Sorts a range in place in stable order
Synopsis
template<typename RandIter> void stable_sort(RandIter first, RandIter last); template<typename RandIter, typename Compare> void stable_sort(RandIter first, RandIter last, Compare comp);
The stable_sort
function
template sorts the range [first
,
last
) in place. The sort is
stable, so equivalent elements preserve their original order.
The first version compares items using the <
operator. The second version uses
comp(X
, Y)
to test whether X
<
Y
.
Technical Notes
Postcondition: !(*(i + 1) < *i) for all i in [first, last - 1).
Complexity is at most n log n comparisons, in which n = last - first, provided that enough memory is available for temporary results. If memory is limited, the complexity is at most n (log n)2 comparisons.
Get C++ In a Nutshell now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.