std::list::sort
cppreference.com
 [] |
Google. . , . , . |
![[]](https://upload.cppreference.com/mwiki/images/3/31/Imbox_notice.png){kind=link}
<metanoindex/>
<tbody> </tbody> void sort(); |
(1) | |
template< class Compare > void sort( Compare comp ); |
(2) | |
. .
operator< , comp . .:
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. The ordering of equivalent elements is preserved.| comp | (.. , Compare), true, "", .:
|
()
#include <iostream>
#include <functional>
#include <list>
std::ostream& operator<<(std::ostream& ostr, const std::list<int>& list)
{
for (auto &i : list) {
ostr << " " << i;
}
return ostr;
}
int main()
{
std::list<int> list = { 8,7,5,9,0,1,3,2,6,4 };
std::cout << "before: " << list << "\n";
list.sort();
std::cout << "ascending: " << list << "\n";
list.sort(std::greater<int>());
std::cout << "descending: " << list << "\n";
}
:
before: 8 7 5 9 0 1 3 2 6 4
ascending: 0 1 2 3 4 5 6 7 8 9
descending: 9 8 7 6 5 4 3 2 1 0