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 vote197 views1 answer
C++ restrict template types
C++
13 votes205 views4 answers
How to lock and hide the cursor unity
C++
36 votes206 views2 answers
Remove at index vector c++
C++
0 vote185 views1 answer
Map::begin
C++
0 vote235 views1 answer
Codeforces Round #376 (Div. 2), problem: (A) Night at the Museum
C++
0 vote214 views1 answer
Why do men drink liquor
C++
1 vote229 views1 answer
Qt qstring to double
C++
2 votes181 views1 answer
Rng c++
C++
0 vote192 views1 answer
Cout stack in c++
C++
1 vote182 views1 answer
C++ check if debug or release visual studio
C++