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

4 votes229 views1 answer
C++ array vs vector
C++
1 vote259 views1 answer
C++ vector of class objects
C++
0 vote237 views1 answer
How to take full sentence in c++
C++
-1 vote262 views5 answers
Memset in cpp
C++
1 vote247 views2 answers
C++ Split String By Space into Vector
C++
3 votes251 views2 answers
C++ code for quicksort
C++
0 vote250 views1 answer
Extra parameter in comparator function for sort
C++
0 vote272 views1 answer
Madiar loh
C++
1 vote236 views1 answer
Set cmd size c++
C++
0 vote244 views2 answers
Print all number between a and b in c++
C++