Comparator in sort 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
  }

Comparator in sort c++

bool com_fun(int a,int b){
	if(a<b) return true;
	else return false;
}

sort(arr,arr+n.com_fun);

Similar codes

1 vote377 views2 answers
C++ get last element in array
C++
0 vote330 views1 answer
Javascript if else exercises
C++
0 vote411 views1 answer
Void setup() { // put your setup code here, to run once:in m}void loop() { // put your main code here, to run repeatedly:}
C++
2 votes358 views1 answer
Dlopen failed: library "libomp.so" not found
C++
3 votes313 views2 answers
C++ vector extend vector
C++
0 vote309 views1 answer
Converting a for loop to a while loop C++
C++
7 votes319 views4 answers
C++ hide console
C++
3 votes386 views2 answers
How to get last element of set
C++
3 votes373 views2 answers
C++ code for quicksort
C++
8 votes334 views3 answers
Sum elements in vector c++
C++