Illustrating the generic binary search algorithms : binary_search « STL Algorithms Binary search « C++ Tutorial

1. C++ Tutorial
2. STL Algorithms Binary search
3. binary_search

#include <iostream>
#include <cassert>
#include <algorithm>
#include <vector>
using namespace std;

int main()
{
  vector<int> v(5);
  bool found;

  for (int i = 0; i < 5; ++i)
     v[i] = i;

  found = binary_search(v.begin(), v.end(), 3);
  cout << found << " ";

  // Try searching for a value that's not present:
  found = binary_search (v.begin(), v.end(), 9);
  cout << found;

  return 0;
}

1 0