C++ STL线性查找

#include <iostream>
#include <string>
#include <vector>
#include <iterator>
#include <algorithm>
#include <list>
#include <set>
#include <cstdlib>
using namespace std;

bool mod_greater ( int elem1, int elem2 )
{
 if ( elem1 < 0 )
  elem1 = - elem1;
 if ( elem2 < 0 )
  elem2 = - elem2;
 return elem1 > elem2;
}

int main()
{
 const int x=_MIN(3,-9,mod_greater);
 cout<<x<<endl;

 int a=3,b=3;
 const int& result=_MIN(a,b);
 cout<<result<<endl;

 list<int> L(100);
 list<int>::iterator iter1;
 generate_n(L.begin(),100,rand); //为容器产生随机数
 for(iter1=L.begin();iter1!=L.end();iter1++) //遍历
  cout<<*iter1<<" ";
 cout<<endl;

 iter1=max_element(L.begin(),L.end()); //求最大元素
 cout<<*iter1<<endl;

 /******find()**************/
 list<int> L1;
 L1.push_back(1);
 L1.push_back(5);
 L1.push_back(3);

 list<int>::iterator it=find(L1.begin(),L1.end(),5);
 cout<<"the relult :"<<*it<<endl;

 /******find_if()**************/
  int A[]={4,1,0,3,2,0,6};
  const int N=sizeof(A)/sizeof(int);

  int* p=find_if(A,A+N,bind2nd(less<int>(),0));
  cout<<"first:"<<p-A<<endl;
 /******adjacent_if()**************/
  int B[]={1,2,3,3,42,5};
  const int M=sizeof(B)/sizeof(int);
  const int* p1=adjacent_find(B,B+M,less<int>());//找到相邻<的元素位置

  if(p1!=A+M)
   cout<<"adjacent ele: "<<*p1<<endl;

 return 0;
}