deque rend() function in C++ STL

The deque::rend() is an inbuilt function in C++ STL which returns a reverse iterator which points to the position before the beginning of the deque (which is considered its reverse end).

Syntax:

deque_name.rend()

Parameter: This function does not accept any parameters.

Return value: It returns a reverse iterator which points to the position before the beginning of the deque.

Below program illustrates the above function:



Program 1:

filter_none

edit
close

play_arrow

link
brightness_4
code

// C++ program to illustrate the
// deque::rend() function
#include <bits/stdc++.h>
using namespace std;
  
int main()
{
    deque<int> dq = { 10, 20, 30, 40, 50 };
  
    cout << "The deque in reverse order: ";
  
    // prints the elements in reverse order
    for (auto it = dq.rbegin(); it != dq.rend(); ++it)
        cout << *it << " ";
  
    return 0;
}

chevron_right






                        filter_none









Output:


The deque in reverse order: 50 40 30 20 10





Program 2:











                                    filter_none




                                    edit

                                    close




                                    play_arrow




                                    link

                                    brightness_4

                                    code
                                




















// C++ program to illustrate the 


// deque::rend() function 


#include <bits/stdc++.h> 


using namespace std; 


  


int main() 


{ 


    deque<char> dq = { 'a', 'b', 'c', 'd', 'e' }; 


  


    cout << "The deque in reverse order: "; 


  


    // prints the elements in reverse order 


    for (auto it = dq.rbegin(); it != dq.rend(); ++it) 


        cout << *it << " "; 


  


    return 0; 


} 



















                        chevron_right







                        filter_none









Output:


The deque in reverse order: e d c b a







Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.





    

        My Personal Notes
        arrow_drop_up
    

    

        
        

            
            
        

    


Recommended Posts:
rupesh_rao
Check out this Author's contributed articles.
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.