set crbegin() and crend() function in C++ STL

set::rbegin() and set::rend() in C++ STL

Last Updated : 19 Jun, 2018

set::rbegin() is a built-in function in C++ STL which returns a reverse iterator pointing to the last element in the container. Syntax:

reverse_iterator set_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. Program to demonstrate the set::rbegin() method: Program 1:

CPP

// CPP program to demonstrate the
// set::rbegin() function
#include <bits/stdc++.h>
using namespace std;
int main()
{

    int arr[] = { 14, 12, 15, 11, 10 };

    // initializes the set from an array
    set<int> s(arr, arr + 5);

    set<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 set is " << *(s.rbegin());

    return 0;
}

Output:

15 14 12 11 10 
The last element in set is 15

set::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 set container. Syntax:

reverse_iterator set_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 set container. Below programs illustrate the function: Program 1:

CPP

// CPP program to demonstrate the
// set::rend() function
#include <bits/stdc++.h>
using namespace std;
int main()
{

    int arr[] = { 4, 3, 5, 1, 2 };

    // initializes the set from an array
    set<int> s(arr, arr + 5);

    set<int>::reverse_iterator rit;

    // prints all elements in reverse order
    for (rit = s.rbegin(); rit != s.rend(); rit++)
        cout << *rit << " ";

    return 0;
}

Output:

5 4 3 2 1

set crbegin() and crend() function in C++ STL

T

Twinkl Bajaj

Improve

Article Tags :

Practice Tags :

Similar Reads

In C++, sets are associative container which stores unique elements in some sorted order. By default, it is sorted ascending order of the keys, but this can be changed as per requirement. It provides fast insertion, deletion and search operations.Example: C++#include <iostream> #include <se

Different Ways to Initialize an Set in C++

Initializing a set means assigning some initial values to the elements of the set container. In this article, we will learn different methods to initialize an std::set in C++.Table of ContentUsing Initializer ListOne by One InitializationFrom Another std::setFrom Another STL Container or ArrayUsing

C++ STL Set Insertion and Deletion

Prerequisite: Set A Set is a container implemented in C++ language in STL and has a concept similar to how the set is defined in mathematics. The fact that separates the set from the other containers is that it contains only the distinct elements and elements can be traversed in sorted order. Having

Different Ways to Insert Elements in Set in C++ STL

Prerequisites: Set in C++ The C++ Standard Template Library offers containers called Sets. It functions essentially in the same ways as a binary search tree and is used to store different elements in increasing/decreasing order. There are different methods to insert elements in the set as mentioned

How to Access Elements in Set by Index in C++?

In C++, elements of a set cannot be accessed directly by index or position. However, we can work around this limitation using iterators. In this article, we will learn how to access the elements in set by index in C++.The most efficient way to access a set element by index is to use the std::next()

Different ways to iterate over a set in C++

Sets are a type of associative container in which each element has to be unique because the value of the element identifies it. The values are stored in a specific order. Syntax: set<datatype> setname; Here,Datatype: Set can take any data type depending on the values, e.g. int, char, float, et

Difference between std::set::upper_bound and std::upper_bound in C++

Prerequisites: Random-access Iterators, Bidirectional Iterators Sets are a type of associative container in which each element has to be unique because the value of the element identifies it. The value of the element cannot be modified once it is added to the set, though it is possible to remove and

Difference between std::set vs std::vector in C++ STL

Vectors: Vectors are containers similar to dynamic arrays, with the ability to resize when a new element is inserted or deleted from it. It is a template of Standard Template Library or STL, which provides more flexibility to the program. Elements of vectors are placed in contiguous storage and are