Sorting a vector in C++
Prerequisites : std::sort in C++, vector in C++, initialize a vector in C++.
// C++ program to sort a vector in non-decreasing // order. #include <bits/stdc++.h> using namespace std; int main() { vector<int> v{ 1, 5, 8, 9, 6, 7, 3, 4, 2, 0 }; sort(v.begin(), v.end()); cout << "Sorted \n"; for (auto x : v) cout << x << " "; return 0; } |
chevron_right
filter_none
Output :
Sorted 0 1 2 3 4 5 6 7 8 9
How to sort in descending order?
sort() takes a third parameter that is used to specify the order in which elements are to be sorted. We can pass “greater()” function to sort in descending order. This function does comparison in a way that puts greater element before.
// C++ program to sort a vector in non-increasing // order. #include <bits/stdc++.h> using namespace std; int main() { vector<int> v{ 1, 5, 8, 9, 6, 7, 3, 4, 2, 0 }; sort(v.begin(), v.end(), greater<int>()); cout << "Sorted \n"; for (auto x : v) cout << x << " "; return 0; } |
chevron_right
filter_none
Output :
Sorted 9 8 7 6 5 4 3 2 1 0
How to sort in particular order?
We can also write our own comparator function and pass it as a third parameter.
// A C++ program to sort vector using // our own comparator #include <bits/stdc++.h> using namespace std; // An interval has start time and end time struct Interval { int start, end; }; // Compares two intervals according to staring times. bool compareInterval(Interval i1, Interval i2) { return (i1.start < i2.start); } int main() { vector<Interval> v { { 6, 8 }, { 1, 9 }, { 2, 4 }, { 4, 7 } }; // sort the intervals in increasing order of // start time sort(v.begin(), v.end(), compareInterval); cout << "Intervals sorted by start time : \n"; for (auto x : v) cout << "[" << x.start << ", " << x.end << "] "; return 0; } |
chevron_right
filter_none
Output :
Intervals sorted by start time : [1, 9] [2, 4] [4, 7] [6, 8]
Related Articles :
Sorting a vector of pairs | Set 1
Sorting a vector of pairs | Set 2
Recommended Posts:
- Sorting 2D Vector in C++ | Set 1 (By row and column)
- Sorting 2D Vector in C++ | Set 3 (By number of columns)
- Sorting Vector of Pairs in C++ | Set 1 (Sort by first and second)
- Sorting of Vector of Tuple in C++ (Descending Order)
- Sorting of Vector of Tuple in C++ (Ascending Order)
- Keep track of previous indexes after sorting a vector in C++ STL
- Sorting 2D Vector in C++ | Set 2 (In descending order by row and column)
- Sorting Vector of Pairs in C++ | Set 2 (Sort in descending order by first and second)
- vector::push_back() and vector::pop_back() in C++ STL
- vector::empty() and vector::size() in C++ STL
- vector::front() and vector::back() in C++ STL
- vector::crend() & vector::crbegin() with example
- vector :: cbegin() and vector :: cend() in C++ STL
- vector::begin() and vector::end() in C++ STL
- vector::at() and vector::swap() in C++ STL
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
