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

1 vote245 views1 answer
C++ merge sort
C++
12 votes223 views2 answers
Comparator in sort c++
C++
0 vote201 views1 answer
C++ while loop decrement
C++
0 vote219 views1 answer
Ask a question and answer it in code c++
C++
0 vote217 views1 answer
Return multiple objects from a function C++ using references
C++
1 vote231 views2 answers
Lambda capture as const cpp
C++
-1 vote223 views1 answer
How to rename a file in cpp
C++
6 votes224 views1 answer
Should i learn c or c++
C++
0 vote212 views10 answers
Online compiler c++ with big O calculator
C++
0 vote212 views1 answer
C++ if else if
C++