Answers for "sort implementation c++"

c++ sort code

vector <int> vect; //any container
vector <int>::iterator start = vect.begin(), end=vect.end(); //iterator for the begin and end of the container
sort (start,end); //std::sort (increasing order)
sort (start,end,greater<int>()); //std::sort (decreasing order)

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