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 vote352 views1 answer
C++ how to skip the last element of vector
C++
1 vote358 views1 answer
What is the associative property of an operator
C++
7 votes341 views3 answers
C++ replace
C++
5 votes373 views3 answers
C++ remove space from string
C++
0 vote332 views2 answers
Power in c++
C++
0 vote348 views1 answer
Pros millis()
C++
3 votes285 views1 answer
Rapidjson parse
C++
3 votes315 views1 answer
Resizing dynamic array c++
C++
0 vote331 views1 answer
Powers of 2 in cpp
C++
-1 vote419 views1 answer
How to replace an element in array in c++
C++