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

Similar codes

0 vote302 views1 answer
C++ power of two
C++
0 vote264 views1 answer
C++ while true
C++
1 vote270 views2 answers
Maximum value in map in c++
C++
0 vote318 views1 answer
Get bitshift to wrap c++
C++
5 votes279 views6 answers
Ngrok http
C++
23 votes288 views10 answers
Pycharm
C++
1 vote253 views3 answers
Return use in c++
C++
1 vote269 views1 answer
Google test assert eq float
C++
0 vote252 views1 answer
Zero fill in c++
C++
0 vote271 views1 answer
Use uint in c++
C++