vector.sort code example

Example 1: how to sort a vector in reverse c++

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
   vector<int> v = { 10, 9, 8, 6, 7, 2, 5, 1 };
   sort(v.begin(), v.end(), greater <>());
}

Example 2: sort vector

sort(v.begin(), v.end());

Example 3: 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 << " ";
    }

Example 4: sort vector c++

// C++ program to sort a vector in non-decreasing 
// order. 
#include <bits/stdc++.h> // Vector 
#include <algorithm>  // Sort
using namespace std; 
  
int main() 
{ 
// Initalizing the vector v with these values
    vector<int> v{ 1, 5, 8, 9, 6, 7, 3, 4, 2, 0 }; 
// Vector is sorted in ascending order   
    sort(v.begin(), v.end()); 
  
    return 0; 
}

Example 5: sort vector c++

sort(begin(v), end(v), [] (int a, int b) { return a > b; }); // decrease