template<class InputIterator, class T>
  InputIterator find ( InputIterator first, InputIterator last, const T& value )
  {
    for ( ;first!=last; first++) if ( *first==value ) break;
    return first;
  }

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

int main () {
  int myints[] = { 10, 20, 30 ,40 };
  int * p;

  // pointer to array element:
  p = find(myints,myints+4,30);
  ++p;
  cout << "The element following 30 is " << *p << endl;

  vector<int> myvector (myints,myints+4);
  vector<int>::iterator it;

  // iterator to vector element:
  it = find (myvector.begin(), myvector.end(), 30);
  ++it;
  cout << "The element following 30 is " << *it << endl;

  return 0;
}

接收函数返回值的是一个地址值或者同类型的迭代器。区分string类的find（）函数。

通过it==myvector.end()来判断是否找到此值，相等说明没找到。
补充一例：

#include<iostream> #include <algorithm>//使用泛型算法必须包含头文件algorithm #include<vector> #include<string> using namespace std; int main() {  vector<int> ivec;  while(true)  {   cout<<"continue?no(0) yes-enter an int value(not 0):"<<endl;   int val;   cin>>val;   if(val==0)    break;   else    ivec.push_back(val);  }  cout<<"please enter int value what you want to find:"<<endl;  int ival;  cin>>ival;  vector<int>::const_iterator cit=find(ivec.begin(),ivec.end(),ival);//find算法是在algorithm中定义的  cout<<"what you find "<<ival<<(cit==ivec.end()? " is not find" : " found")<<endl;  return 0; }

删除容器的操作可见C++primer第四版的9.3.7。