C++ In a Nutshell

Name

sort function template — Sorts a range in place

Synopsis

template<typename RandIter>
  void sort(RandIter first, RandIter last);
template<typename RandIter, typename Compare>
  void sort(RandIter first, RandIter last, Compare comp);

The sort function template sorts the range [first, last) in place. The sort is not stable, so equivalent elements do not 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 n log n comparisons in the average case, in which n = last - first. Worst case performance might be worse. Use stable_sort if the worst-case performance is more important than the average performance.

See Also

merge function template, nth_element function template, partial_sort function template, partition function template, sort_heap function template, stable_sort function template