From Cppreference
|
|
| void sort();
|
(1)
|
|
|
|
|
| template< class Compare >
void sort( Compare comp );
|
(2)
|
|
|
|
|
Sorts the elements in ascending order. The order of equal elements is guaranteed to be preserved. The first version uses operator< to compare the elements, the second version uses the given comparison function comp.
[edit] Parameters
| comp
|
-
|
comparison function which returns true if the first argument is less than the second.
The signature of the comparison function should be equivalent to the following:
|
|
| bool cmp(const Type1 &a, const Type2 &b);
|
|
|
|
|
|
The signature does not need to have const &, but the function must not modify the objects passed to it.
The types Type1 and Type2 must be such that an object of type list<T,Allocator>::const_iterator can be dereferenced and then implicitly converted to both of them.
|
[edit] Return value
(none)
[edit] Example
[edit] Complexity