Input: set = [10 20 30 70 80 90 100 40 50 60] Output: 100 90 80 70 60 50 40 30 20 10 Input: set = [1 2 3 4 5] Output: 5 4 3 2 1
To traverse a Set in reverse order, a reverse_iterator can be declared on it and it can be used to traverse the set from the last element to the first element with the help of rbegin() and rend() functions.
- Get the set.
- Declare the reverse iterator on this set.
- Traverse the set from the last element to the first element with the help of rbegin() and rend() functions.
Below is the implementation of the above approach:
Elements of Set in normal order: 10 11 12 14 15 Elements of Set in reverse order: 15 14 12 11 10
- How to traverse a STL map in reverse direction?
- Traverse through a HashSet in Java
- Traverse through a HashMap in Java
- How to traverse through all values for a given key in multimap?
- CSS | direction Property
- CSS | flex-direction Property
- HTML | DOM Style direction Property
- std::reverse() in C++
- forward_list::reverse() in C++ STL
- How to reverse an Array using STL in C++?
- How to reverse a Vector using STL in C++?
- All reverse permutations of an array using STL in C++
- Perl | Reverse an array
- list reverse function in C++ STL
- Reverse a LinkedList in Java
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. 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.