Solution for "sort vecotr using compare"

#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() {    vector<int> v = { 10, 9, 8, 6, 7, 2, 5, 1 };    sort(v.begin(), v.end(), greater <>()); }

how to sort a vector in reverse c++

Similar codes for "sort vecotr using compare"


Latest 'C++' questions

Added before "sort vecotr using compare"