Search element in a sequence with algorithm binary_search. - C++ STL Algorithm

Description

Search element in a sequence with algorithm binary_search.

Demo Code

#include <iostream> 
#include <algorithm> // algorithm definitions 
#include <vector> // vector class-template definition 
#include <iterator> 
using namespace std; 

int main() /*from w  w  w. ja  va2s  .  co  m*/
{ 
   const int SIZE = 10; 
   int a[ SIZE ] = { 10, 2, 17, 5, 16, 8, 13, 11, 20, 7 }; 
   vector< int > v( a, a + SIZE ); // copy of a 
   ostream_iterator< int > output( cout, " " ); 

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

    // sort elements of v 
    sort( v.begin(), v.end() ); 

    // use binary_search to locate 13 in v 
    if ( binary_search( v.begin(), v.end(), 13 ) ) 
       cout << "\n\n13 was found in v"; 
    else 
       cout << "\n\n13 was not found in v" ; 

    // use binary_search to locate 100 in v 
    if ( binary_search( v.begin(), v.end(), 100 ) ) 
       cout << "\n100 was found in v" ; 
    else 
       cout << "\n100 was not found in v" ; 

    cout << endl; 
}

Result

• Previous
• Next

Related Tutorials

• Using function accumulate with a function pointer and with a function object.
• Using accumulate() algorithm and plus() function object
• Demonstrate insert iterators with queues
• Using bind2nd() to create a unary function object that will return true when a value is greater than 10.
• Use a pointer-to-function adapter, ptr_fun