Menu
×
   ❮     
HTML CSS JAVASCRIPT SQL PYTHON JAVA PHP HOW TO W3.CSS C C++ C# BOOTSTRAP REACT MYSQL JQUERY EXCEL XML DJANGO NUMPY PANDAS NODEJS R TYPESCRIPT ANGULAR GIT POSTGRESQL MONGODB ASP AI GO KOTLIN SASS VUE DSA GEN AI SCIPY AWS CYBERSECURITY DATA SCIENCE
     ❯   

C++ Tutorial

C++ HOME C++ Intro C++ Get Started C++ Syntax C++ Output C++ Comments C++ Variables C++ User Input C++ Data Types C++ Operators C++ Strings C++ Math C++ Booleans C++ If...Else C++ Switch C++ While Loop C++ For Loop C++ Break/Continue C++ Arrays C++ Structures C++ Enums C++ References C++ Pointers

C++ Functions

C++ Functions C++ Function Parameters C++ Function Overloading C++ Scope C++ Recursion

C++ Classes

C++ OOP C++ Classes/Objects C++ Class Methods C++ Constructors C++ Access Specifiers C++ Encapsulation C++ Inheritance C++ Polymorphism C++ Files C++ Exceptions C++ Date

C++ Data Structures

C++ Data Structures & STL C++ Vectors C++ List C++ Stacks C++ Queues C++ Deque C++ Sets C++ Maps C++ Iterators C++ Algorithms

C++ How To

C++ Add Two Numbers C++ Random Numbers

C++ Reference

C++ Reference C++ Keywords C++ <iostream> C++ <fstream> C++ <cmath> C++ <string> C++ <cstring> C++ <ctime> C++ <vector> C++ <algorithm>

C++ Examples

C++ Examples C++ Real-Life Examples C++ Compiler C++ Exercises C++ Quiz C++ Certificate


C++ algorithm upper_bound() function

❮ Algorithm Functions


Example

Find the first value greater than 7 in a sorted vector:

vector<int> numbers = {1, 7, 3, 5, 9, 2};
sort(numbers.begin(), numbers.end());
auto it = upper_bound(numbers.begin(), numbers.end(), 7);
if(it != numbers.end()) {
  cout << *it << " is the first value greater than 7";
} else {
  cout << "No elements found above the upper bound";
}
Try it Yourself »

Definition and Usage

The upper_bound() function is an efficient algorithm to find the first value in a sorted data range that is above a specified upper bound.

If the data range is not already sorted then the function may return an incorrect result. The sort() function can be used to sort elements in the data range.

The range of data is specified by iterators.

Syntax

upper_bound(iterator start, iterator end, <type> bound);

<type> refers to the type of the data that the range contains.

Parameter Values

Parameter Description
start Required. An iterator pointing to the start of the data range.
end Required. An iterator pointing to the end of the data range. Elements up to this position will be included, but the element at this position will not be.
bound Required. Specifies the upper bound.

Technical Details

Returns: An iterator pointing to the element containing the first value which is above the upper bound. If no element can be found then it returns the end of the data range.

Related Pages

Read more about data structures in our Data Structures Tutorial.

Read more about iterators in our Iterators Tutorial.

Read more about algorithms in our Algorithms Tutorial.


❮ Algorithm Functions

×

Contact Sales

If you want to use W3Schools services as an educational institution, team or enterprise, send us an e-mail:
sales@w3schools.com

Report Error

If you want to report an error, or if you want to make a suggestion, send us an e-mail:
help@w3schools.com

W3Schools is optimized for learning and training. Examples might be simplified to improve reading and learning. Tutorials, references, and examples are constantly reviewed to avoid errors, but we cannot warrant full correctness of all content. While using W3Schools, you agree to have read and accepted our terms of use, cookie and privacy policy.

Copyright 1999-2024 by Refsnes Data. All Rights Reserved. W3Schools is Powered by W3.CSS.