Binary search a vector : vector find « Vector « C++






Binary search a vector

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

void print(int elem){
  cout << elem << " ";
}

int main(int argc, char** argv)
{
  vector<int> v1, v2, vectorMerged;
  v1.push_back(1);
  v1.push_back(2);
  v1.push_back(3);

  v2.push_back(2);
  v2.push_back(3);
  v2.push_back(4);

  sort(v1.begin(), v1.end());
  sort(v2.begin(), v2.end());

  vectorMerged.resize(v1.size() + v2.size());
  merge(v1.begin(), v1.end(), v2.begin(),v2.end(), vectorMerged.begin());

  if (binary_search(vectorMerged.begin(), vectorMerged.end(), 3)) {
      cout << "That number is in the vector.\n";
  } else {
      cout << "That number is not in the vector\n";
  }
  return (0);
}
  
    
  








Related examples in the same category

1.Locate maximum element in a vector
2.Locate minimum element in a vector
3.Demonstrating the generic find algorithm with a vector
4.Find the min value in the vector
5.Find the max value in the vector
6.Find the first pair of matching consecutive elements
7.Find the first of two values
8.Find the first subsequence
9.Find the last subsequence (which should be the same as the first)
10.Find the first subsequence of two consecutive 8s
11.Search the vector for the elements present in the list
12.Returns the positions of all values within a range