Stl sort in c++

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 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)

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++ sort

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

Source: en.cppreference.com

Similar codes

1 vote148 views1 answer
C++ hide cursor
C++
0 vote150 views1 answer
Softwareegg.courses4u
C++
0 vote186 views1 answer
Iterate over map c++17
C++
0 vote170 views1 answer
Passing 2d array by reference c++
C++
8 votes152 views3 answers
Initialize all elements of vector to 0 c++
C++
20 votes132 views10 answers
Prime number c++
C++
1 vote148 views1 answer
Swap using Function template in c++
C++
3 votes180 views3 answers
Get first element of set c++
C++
-1 vote139 views1 answer
A[12] = h + A[8]
C++
0 vote138 views3 answers
Libevent parse multipart formdata site:stackoverflow.com
C++