C++ List sort()

C++ List sort() function arranges the elements of a given list in an increasing order. It does not involve in any construction and destruction of elements. Elements are only moved within the container.

Syntax

Parameter

It does not contain any parameter.

Return value

It does not return any value.

Example 1

Let's see a simple example

#include <iostream>
#include<list>
using namespace std;
int main()
{
   list<int> li={6,4,10,2,4,1};
   list<int>:: iterator itr;
   cout<<?Elements of list are :?;
   for(itr=li.begin();itr!=li.end();++itr)
   std::cout << *itr<<",";
   li.sort();
   cout<<'\n';
   cout<<?Sorted elements are :?;
   for(itr=li.begin();itr!=li.end();++itr)
   std::cout << *itr <<",";
    return 0;
}

Output:

Elements of list are : 6,4,10,2,4,1,
Sorted elements are : 1,2,4,4,6,10

In this example, sort() function sorts the elements of a given list and its output is 1,2,4,4,6,10.

Example 2

Let's see a simple example

#include <iostream>
#include<list>
using namespace std;
int main()
{
   list<char> li={'j','a','v','a','T','p','o','i','n','t'};
   list<char>:: iterator itr;
   for(itr=li.begin();itr!=li.end();++itr)
   std::cout << *itr;
   li.sort();
   cout<<'\n';
   for(itr=li.begin();itr!=li.end();++itr)
   std::cout << *itr;
    return 0;
}

Output: