CPP

stl for sorting IN C++

// STL IN C++ FOR SORING
#include <bits/stdc++.h> 
#include <iostream> 
using namespace std; 
int main() 
{ 
    int arr[] = {1, 5, 8, 9, 6, 7, 3, 4, 2, 0}; 
    int n = sizeof(arr)/sizeof(arr[0]); 
    sort(arr, arr+n);  // ASCENDING SORT
    reverse(arr,arr+n);   //REVERESE ARRAY 
    sort(arr, arr + n, greater<int>());// DESCENDING SORT
  } 

sort stl

1) When using vector:
	sort(arr.begin(), arr.end());

2) When using array:
	sort(arr, arr+n);
	sort(arr, arr+n, greater<int>()); //sorts in descending

c++ sort

#include<bits/stdc++.h>

vector<int> v = { 6,1,4,5,2,3,0};
sort(v.begin() , v.end()); // {0,1,2,3,4,5,6} sorts ascending
sort(v.begin(), v.end(), greater<int>()); // {6,5,4,3,2,1,0} sorts descending

c++ std::sort

#include <algorithm>
#include <functional>
#include <array>
#include <iostream>
#include <string_view>
 
int main()
{
    std::array<int, 10> s = {5, 7, 4, 2, 8, 6, 1, 9, 0, 3};
 
    auto print = [&s](std::string_view const rem) {
        for (auto a : s) {
            std::cout << a << ' ';
        }
        std::cout << ": " << rem << '
';
    };
 
    std::sort(s.begin(), s.end());
    print("sorted with the default operator<");
 
    std::sort(s.begin(), s.end(), std::greater<int>());
    print("sorted with the standard library compare function object");
 
    struct {
        bool operator()(int a, int b) const { return a < b; }
    } customLess;
    std::sort(s.begin(), s.end(), customLess);
    print("sorted with a custom function object");
 
    std::sort(s.begin(), s.end(), [](int a, int b) {
        return a > b;
    });
    print("sorted with a lambda expression");
}

// Output:
//0 1 2 3 4 5 6 7 8 9 : sorted with the default operator<
//9 8 7 6 5 4 3 2 1 0 : sorted with the standard library compare function object
//0 1 2 3 4 5 6 7 8 9 : sorted with a custom function object
//9 8 7 6 5 4 3 2 1 0 : sorted with a lambda expression

c++ sort

 int arr[]= {2,3,5,6,1,2,3,6,10,100,200,0,-10};
    int n = sizeof(arr)/sizeof(int);  
    sort(arr,arr+n);

    for(int i: arr)
    {
        cout << i << " ";
    }

stl sort in c++

sort(arr, arr+n); // sorts in ascending order

how to sort in c++

#include <bits/stdc++.h>
using namespace std;
  
int main()
{
    int arr[] = { 1, 5, 8, 9, 6, 7, 3, 4, 2, 0 };
    int n = sizeof(arr) / sizeof(arr[0]);
    sort(arr, arr + n);
  
    for (int i = 0; i < n; ++i)
        cout << arr[i] << " ";
    return 0;
}

sort c++

#include <algorithm>    // std::sort

int myints[] = {32,71,12,45,26,80,53,33};
// using default comparison (operator <):
std::sort (myvector.begin(), myvector.begin()+4);           //(12 32 45 71)26 80 53 33

// fun returns some form of a<b
std::sort (myvector.begin()+4, myvector.end(), myfunction); // 12 32 45 71(26 33 53 80)

sort c++

sort(arr, arr+length); //increase
sort(arr, arr+length, greater<int>()); //decrease 

sort c++

#include <algorithm>    // std::sort
#include <vector>		// std::vector

std::vector<int> vec = {1,3,2}; // vec = [1, 3, 2]
std::sort (vec.begin(), vec.end()); // vec = [1, 2, 3]

stl sort in c++

sort(arr, arr+n, greater<int>()); // sorts in descending order

c++ sort

std::vector s = {5, 1, 3, 6, 2,};
std::sort(s.begin(), s.end());

sort c++ stl

#include <bits/stdc++.h>
using namespace std;
  
int main()
{
    int arr[] = { 1, 5, 8, 9, 6, 7, 3, 4, 2, 0 };
    int n = sizeof(arr) / sizeof(arr[0]);
  
    /*Here we take two parameters, the beginning of the
    array and the length n upto which we want the array to
    be sorted*/
    sort(arr, arr + n);
  
    cout << "
Array after sorting using "
            "default sort is : 
";
    for (int i = 0; i < n; ++i)
        cout << arr[i] << " ";
  
    return 0;
}