#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);
}
|