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; 
}

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

Similar codes

1 vote193 views1 answer
Sfml mouse click
C++
0 vote189 views1 answer
TCA9548 I2CScanner Arduino
C++
-1 vote182 views1 answer
Fast way to check if a number is prime C++
C++
0 vote183 views1 answer
Are arrays faster than vectors c++
C++
0 vote180 views1 answer
Map::begin
C++
0 vote189 views1 answer
C++ clip values
C++
1 vote210 views1 answer
How to reverse a string in c++ using reverse function
C++
3 votes191 views4 answers
C++ char array size
C++
0 vote143 views1 answer
Sleep not declared in this scope c++
C++
0 vote182 views1 answer
Uint16_t does not name a type
C++