Sort() Function in C++

Sorting in Ascending Order

By default, the array sort function in c++ sorts the elements in ascending order. Below is a simple code to show the working of sort(). 

Code

• C++

C++

#include <bits/stdc++.h>
using namespace std;
  
int main()
{
     int n;
    cin>>n;
    int arr[n];
    for(int i=0;i<n;i++)
    {
      cin>>arr[i];
    }
  
    sort(arr, arr + n);
  
    cout << "\nArray after sorting using "
            "default sort is : \n";
    for (int i = 0; i < n; ++i)
        cout << arr[i] << " ";
  
    return 0;
}

You can also try this code with Online C++ Compiler

Run Code

Input

n=6
7 5 3 1 2 4

Output

Sorting in Descending Order

The third parameter of the array sort function in c++ is used to determine the order in which the components should be sorted. The "greater()" function can sort the results in descending order. This method compares items in a way that prioritizes more important elements first.

Code

• C++

C++

#include <bits/stdc++.h>
using namespace std;
  
int main()
{
     int n;
     cin>>n;
    int arr[n];
    for(int i=0;i<n;i++)
    {
      cin>>arr[i];
    }
  
    sort(arr, arr + n, greater<int>());


	cout << "Array after sorting : \n";
	for (int i = 0; i < n; ++i)
	cout << arr[i] << " ";
	return 0;
}

You can also try this code with Online C++ Compiler

Run Code

Input

n=6
7 5 3 1 2 4

Output

Read More - Time Complexity of Sorting Algorithms

Sorting in Particular Order

We can also write our comparator array sort function in c++and pass it as a third parameter. The “comparator” function returns a value of type bool, which tells us whether the first argument passed should be placed before the second argument or not.

Code

• C++

C++

#include <bits/stdc++.h>
using namespace std;


template <class T> bool func(T x1, T x2)
{ 
return x1 <= x2;
}


int main()
{
    int n;
    cin>>n;
    int arr[n];
    for(int i=0;i<n;i++)
    {
      cin>>arr[i];
    }
    sort(arr, arr+n, func<int>);
    cout<< "The array after sorting is:"<<endl;


   for (int i = 0;i<n; i++) {
   cout << arr[i] << " ";
   }


return 0;
}

You can also try this code with Online C++ Compiler

Run Code

Input

n=6
7 5 3 1 2 4

Output

Complexity

The array sort function in c++ takes O(log N) time and O(log N) additional space.

Also check out this article - Pair in C++

Frequently Asked Questions

What is the sort function in C++?

The sort function in C++ is a standard library function used to sort elements in a container, such as arrays or vectors, in ascending order based on their values.

What is the use of sort () function?

The sort() function is used to arrange elements in ascending order within a container, such as arrays or vectors, allowing for efficient data organization and retrieval.

What is the function sort vector in C++?

The sort function in C++ can be applied to vectors to rearrange their elements in ascending order, facilitating efficient data manipulation and retrieval operations.

What is the selection sort function in C++?

The selection sort function in C++ is a sorting algorithm that iteratively selects the minimum element from an unsorted portion of the array and swaps it with the element at the beginning of the unsorted portion until the entire array is sorted.

How many types of sort are there in C++?

In C++, there are various types of sorting algorithms, including bubble sort, insertion sort, selection sort, merge sort, and quick sort, each with unique approaches to arranging elements in ascending or descending order.

Conclusion

Let's sum up the article. This article examined the various circumstances and use cases of the C++ array sort function. All of that is covered in the article. I hope that everyone like it.

If you want to learn more, check out our articles on Construct the Full K-ary Tree from its Preorder Traversal, Regular and Bipartite graphs, What Is Web2Py?, Why To Use Web2py?, Postbacks and Internationalization in web2py, Third Party Modules In Web2py, Tasks In Web2py, and  XML in Web2py.

Recommended Problems - 

• Sort 0 1 2 
• Wiggle sort
• Find first and last position in sorted array
   

Happy Coding!