Use binary_search to locate a value in a vector : binary_search « STL Algorithms Binary search « C++ Tutorial

Home
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 » binary_search 
26.1.2.Use binary_search to locate a value in a vector
#include <iostream>
using std::cout;
using std::endl;

#include <algorithm>
#include <vector>
#include <iterator>

int main()
{
   int a10 102175168131120};
   std::vector< int > va, a + 10 )// copy of a
   std::ostream_iterator< int > outputcout, " " );

   cout << "Vector v contains: ";
   std::copyv.begin(), v.end(), output )// display output vector

   // locate first occurrence of 16 in v
   std::vector< int >::iterator location;
   // use binary_search to locate 13 in v
   if std::binary_searchv.begin(), v.end()13 ) )
      cout << "\n\n13 was found in v";
   else
      cout << "\n\n13 was not found in v";


   cout << endl;
   return 0;
}
Vector v contains: 10 2 17 5 16 8 13 11 20 7

13 was not found in v
26.1.binary_search
26.1.1.Illustrating the generic binary search algorithms
26.1.2.Use binary_search to locate a value in a vector
26.1.3.binary_search a list
26.1.4.Use binary_search() to binary search a vector
26.1.5.Binary search after sorting
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.