#include <algorithm>
if(std::find(v.begin(), v.end(), x) != v.end()) {
/* v contains x */
} else {
/* v does not contain x */
}#include <algorithm>
#include <vector>
vector<int> vec;
//can have other data types instead of int but must same datatype as item
std::find(vec.begin(), vec.end(), item) != vec.end()auto it = find(vec.begin(),vec,end(), item)!
if(it != vec.end()){
int index = it - vec.begin();
}#include <algorithm>
#include <vector>
if ( std::find(vec.begin(), vec.end(), item) != vec.end() )
do_this();
else
do_that();#include <bits/stdc++.h>
using namespace std;
int main()
{
vector<int>v ;
v.push_back(1);
v.push_back(2);
v.push_back(3);
v.push_back(4);
v.push_back(5);
v.push_back(6);
vector<int>::iterator it;
it=find(v.begin(),v.end(),4);
if(it!=v.end())
cout<<it-v.begin()<<endl;
return 0;
}
it = find (vec.begin(), vec.end(), ser);
if (it != vec.end())
{
cout << "Element " << ser <<" found at position : " ;
cout << it - vec.begin() << " (counting from zero) \n" ;
}
else{
cout << "Element not found.\n\n";
}