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.
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 std::end() which points to the element next to the last element of the set.
Example 1: Below program illustrate the above function:
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
Example 2: Below is a better code that also checks if the given element is greater than or equal to the greatest.
The given key is greater than or equal to the largest element The immediate greater element is 4
- How to call some function before main() function in C++?
- Function Overloading vs Function Overriding in C++
- Difference between Virtual function and Pure virtual function in C++
- What happens when a virtual function is called inside a non-virtual function in C++
- div() function in C++
- log() function in C++
- exp() function C++
- fma() function in C++
- unordered_map end( ) function in C++ STL
- strcspn() function in C/C++
- array get() function in C++ STL
- array at() function in C++ STL
- iswspace() function in C/C++
- Modulus function in C++ STL
- transform_inclusive_scan() function in C++
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.
Improved By : shashanka136