Use upper_bound to locate the last point : upper_bound « STL Algorithms Binary search « C++ Tutorial

1.	Language Basics
2.	Data Types
3.	Operators statements
4.	Array
5.	Development
6.	Exceptions
7.	Function
8.	Structure
9.	Class
10.	Operator Overloading
11.	Pointer
12.	File Stream
13.	template
14.	STL Introduction
15.	string
16.	vector
17.	list
18.	bitset
19.	set multiset
20.	valarray
21.	queue stack
22.	deque
23.	map multimap
24.	STL Algorithms Modifying sequence operations
25.	STL Algorithms Non modifying sequence operations
26.	STL Algorithms Binary search
27.	STL Algorithms Sorting
28.	STL Algorithms Merge
29.	STL Algorithms Min Max
30.	STL Algorithms Iterator
31.	STL Algorithms Heap
32.	STL Algorithms Helper

C / ANSI-C

C Tutorial

C++

Visual C++ .NET

C++ Tutorial » STL Algorithms Binary search » upper_bound

26.4.3.Use upper_bound to locate the last point

#include <iostream>

#include <algorithm>

#include <vector>



using namespace std;



int main()

{

   const int SIZE = 10;

   int a1[] = { 2, 2, 4, 4, 4, 6, 6, 6, 6, 8 };

   vector< int > v( a1, a1 + SIZE );



   vector< int >::iterator upper;



   cout << "\n\nUse upper_bound to locate the last point\n"

        << "at which 7 can be inserted in order";

   upper = upper_bound( v.begin(), v.end(), 7 );

   cout << "\n   Upper bound of 7 is element " 

        << ( upper - v.begin() ) << " of vector v";



   return 0;

}

26.4.upper_bound
	26.4.1.	Return iterator from std::upper_bound
	26.4.2.	lower_bound and upper_bound
	26.4.3.	Use upper_bound to locate the last point
	26.4.4.	Upper bound of 6

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.