The C++ function std::list::sort() sorts the elements of the list in ascending order. The order of equal elements is preserved. It uses operator< for comparison.
DeclarationFollowing is the declaration for std::list::sort() function form std::list header.
C++98void sort();Parameters
None
Return valueNone
ExceptionsThis member function never throws exception.
Time complexityLinear i.e. O(n)
ExampleThe following example shows the usage of std::list::sort() function.
#include <iostream> #include <list> using namespace std; int main(void) { list<int> l = {1, 4, 2, 5, 3}; cout << "Contents of list before sort operation" << endl; for (auto it = l.begin(); it != l.end(); ++it) cout << *it << endl; l.sort(); cout << "Contents of list after sort operation" << endl; for (auto it = l.begin(); it != l.end(); ++it) cout << *it << endl; return 0; }
Let us compile and run the above program, this will produce the following result −
Contents of list before sort operation 1 4 2 5 3 Contents of list after sort operation 1 2 3 4 5
list.htm
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4