Sort array 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 array c++

//me
int arr[6] = {3,1,4,0,5,2};
sort(arr, arr+6);

//arr is now {0,1,2,3,4,5}

C++ array sort method

#include <algorithm>
#include <iostream>
#include <array>
using namespace std;

int main() {
    array<int, 5> arraysort{ 4,2,3,5,1 };
    sort(arraysort.begin(), arraysort.end());
    for (int i = 0; i < arraysort.size(); i++) {
        cout << arraysort[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)

How to sort array in c++

#include <algorithm>

int main(){
  int v[2000];
  std::sort(std::begin(v), std::end(v));
}

Source: stackoverflow.com

Similar codes

0 vote124 views1 answer
How to store pair in min heap in c++
C++
1 vote139 views1 answer
How to specify how many decimal to print out with std::cout
C++
3 votes128 views2 answers
Fast Inverse Square Root
C++
0 vote149 views1 answer
Map float
C++
0 vote136 views1 answer
C++ open all files in directory
C++
0 vote163 views1 answer
Stack implementation
C++
0 vote139 views1 answer
Srand() c++
C++
1 vote165 views1 answer
Double to float c++
C++
5 votes91 views4 answers
Power in cpp
C++
0 vote136 views1 answer
Search a word in cpp file
C++