time complexity of find fun in vector stl c++

Can you explain how find function works in STL C++ vector and what is its time complexity?

vector<int> v; if(find(v.begin(),v.end(),element)==v.end()) do this; else do this