set upper_bound() function in C++ STL

The set::upper_bound() is a built-in function in C++ STL which returns an iterator pointing to the immediate next element which is just greater than k. If the key passed in the parameter exceeds the maximum key in the container, then the iterator returned points to next of last element (which can be identified using set end() function) in the set container.

Syntax:

set_name.upper_bound(key)

Parameters: This function accepts a single mandatory parameter key which specifies the element whose upper bound is to be returned.

Return Value: The function returns an iterator pointing to the immediate next element which is just greater than k. If the key passed in the parameter exceeds the maximum key in the container, then the iterator points to the last element in the set container.

Below program illustrate the above function:



filter_none

edit
close

play_arrow

link
brightness_4
code

// CPP program to demonstrate the
// set::upper_bound() function
#include <bits/stdc++.h>
using namespace std;
int main()
{
    set<int> s;
  
    // Function to insert elements
    // in the set container
    s.insert(1);
    s.insert(4);
    s.insert(2);
    s.insert(5);
    s.insert(6);
  
    cout << "The set elements are: ";
    for (auto it = s.begin(); it != s.end(); it++)
        cout << *it << " ";
  
    // when 2 is present
    // points to next element after 2
    auto it = s.upper_bound(2);
    cout << "\nThe upper bound of key 2 is ";
    cout << (*it) << endl;
  
    // when 3 is not present
    // points to next greater after 3
    it = s.upper_bound(3);
    cout << "The upper bound of key 3 is ";
    cout << (*it) << endl;
  
    return 0;
}

chevron_right


Output:

The set elements are: 1 2 4 5 6 
The upper bound of key 2 is 4
The upper bound of key 3 is 4

Below is better code that also checks if the given element is greater than the greatest.

filter_none

edit
close

play_arrow

link
brightness_4
code

// CPP program to demonstrate the
// set::upper_bound() function
#include <bits/stdc++.h>
using namespace std;
int main()
{
    set<int> s;
  
    // Function to insert elements
    // in the set container
    s.insert(1);
    s.insert(4);
    s.insert(2);
    s.insert(5);
    s.insert(6);
  
    int key = 8;
    auto it = s.upper_bound(key);
    if (it == s.end())
        cout << "The given key is greater "
                "than the largest element \n";
    else
        cout << "The immediate greater element "
             << "is " << *it << endl;
  
    key = 3;
    it = s.upper_bound(key);
    if (it == s.end())
        cout << "The given key is greater "
                "than the largest element \n";
    else
        cout << "The immediate greater element "
             << "is " << *it << endl;
  
    return 0;
}

chevron_right


Output:

The given key is greater than the largest element 
The immediate greater element is 4


My Personal Notes arrow_drop_up

The function of education is to teach one to think intensively and to think critically

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.




Article Tags :
Practice Tags :


1


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.