Skip to content
Related Articles

Related Articles

Improve Article

multiset rbegin() and rend() function in C++ STL

  • Last Updated : 19 Jul, 2018
  1. multiset::rbegin() is a built-in function in C++ STL which returns a reverse iterator pointing to the last element in the multiset container.

    Syntax:

    reverse_iterator multiset_name.rbegin()
    

    Parameters: The function does not take any parameter.

    Return value: The function returns a reverse iterator pointing to the last element in the container.

    Below program illustrate the multiset::rbegin() method:




    // CPP program to demonstrate the
    // multiset::rbegin() function
    #include <bits/stdc++.h>
    using namespace std;
    int main()
    {
      
        int arr[] = { 15, 12, 15, 11, 10, 10 };
      
        // initializes the set from an array
        multiset<int> s(arr, arr + 6);
      
        multiset<int>::reverse_iterator rit;
      
        // prints all elements in reverse order
        for (rit = s.rbegin(); rit != s.rend(); rit++)
            cout << *rit << " ";
      
        cout << "\nThe last element in multiset is " << *(s.rbegin());
      
        return 0;
    }
    Output:



    15 15 12 11 10 10 
    The last element in multiset is 15
    

  2. multiset::rend() in an inbuilt function in C++ STL which returns a reverse iterator pointing to the theoretical element right before the first element in the multiset container.

    Syntax:

    reverse_iterator multiset_name.rend()
    

    Parameter: The function does not accepts any parameter.

    Return value: The function returns a reverse iterator pointing to the theoretical element right before the first element in the multiset container.

    Below program illustrate the multiset::rend() function:




    // CPP program to demonstrate the
    // multiset::rend() function
    #include <bits/stdc++.h>
    using namespace std;
    int main()
    {
      
        int arr[] = { 15, 13, 15, 11, 13, 10 };
      
        // initializes the set from an array
        multiset<int> s(arr, arr + 6);
      
        multiset<int>::reverse_iterator rit;
      
        // prints all elements in reverse order
        for (rit = s.rbegin(); rit != s.rend(); rit++)
            cout << *rit << " ";
      
        return 0;
    }
    Output:
    15 15 13 13 11 10
    
Want to learn from the best curated videos and practice problems, check out the C++ Foundation Course for Basic to Advanced C++ and C++ STL Course for foundation plus STL.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.



My Personal Notes arrow_drop_up
Recommended Articles
Page :