std::forward_list::sort() in C++ STL
Forward list in STL implements singly linked list. Introduced from C++11, forward list are useful than other containers in insertion, removal and moving operations (like sort) and allows time constant insertion and removal of elements.It differs from list by the fact that forward list keeps track of location of only next element while list keeps track to both next and previous elements.
forward_list::sort()
sort() function is used to sort the elements of the container by changing their positions.
Syntax :
1. forwardlistname.sort() Parameters : No parameters are passed. Result : The elements of the container are sorted in ascending order. 2. forwardlistname.sort(predicate) Parameters : predicate is used to define your own custom sorting function, it will return boolean output Result : The elements of the container sorted in the order as per predicate function
Examples:
Input : myflist{1, 5, 3, 2, 4}; myflist.sort(); Output : 1, 2, 3, 4, 5 Input : myflist{"This","is","w3wiki"}; myflist.sort(); Output : GeekforBeginner, This, is
Errors and Exceptions
1. It has a basic no exception throw guarantee.
CPP
// SORTING INTEGERS // CPP program to illustrate // Implementation of sort() function #include <iostream> #include <forward_list> using namespace std; int main() { // forward list declaration of integer type forward_list< int > myflist{1, 5, 3, 2, 4}; // sort function myflist.sort(); // printing the forward list after sort for ( auto it = myflist.begin(); it != myflist.end(); ++it) cout << ' ' << *it; return 0; } |
Output:
1 2 3 4 5
CPP
// SORTING STRINGS // CPP program to illustrate // Implementation of sort() function #include <iostream> #include <forward_list> #include <string> using namespace std; int main() { // forward list declaration of string type forward_list<string> myflist{ "This" , "is" , "w3wiki" }; // sort function myflist.sort(); // printing the forward list after sort for ( auto it = myflist.begin(); it != myflist.end(); ++it) cout << ' ' << *it; return 0; } |
Output:
w3wiki This is
Time Complexity : O(nlogn)
C++
// SORTING STRINGS USING CUSTOM COMPARATOR FUNCTION // CPP program to illustrate // Implementation of sort() function #include <iostream> #include <forward_list> #include <string> using namespace std; bool comparator(string a, string b) { return a.length() <= b.length(); } int main() { // forward list declaration of string type forward_list<string> myflist{ "This" , "is" , "w3wiki" }; // sort function myflist.sort(comparator); // printing the forward list after sort for ( auto it = myflist.begin(); it != myflist.end(); ++it) cout << ' ' << *it; return 0; } |
Output :
is This w3wiki
Time Complexity – O(nlog(n))
Contact Us