四个简单算法：min_element,max_element,sort,find

转自：http://hi.baidu.com/btcartoon/blog/item/3d8c87efb53d2c1efdfa3c1d.html

#include <iostream>

#include <vector>

#include <algorithm>

using namespace std;

int main()

{

vector<int> coll;

vector<int>::iterator pos;

coll.push_back(3);

coll.push_back(7);

coll.push_back(1);

coll.push_back(4);

coll.push_back(5);

for(int i=0 ; i<coll.size() ; ++i)

cout << coll[i] << " ";

cout << endl;

pos = min_element(coll.begin() , coll.end());

cout << "min:" << *pos << endl;

pos = max_element(coll.begin() , coll.end());

cout << "max:" << *pos << endl;

sort(coll.begin() , coll.end());

cout << "after sort:" << endl;

for(int i1=0 ; i1<coll.size() ; ++i1)

cout << coll[i1] << " ";

cout << endl;

pos = find(coll.begin() , coll.end() , 3);

reverse(pos , coll.end());

cout << "after reverse at 3:" << endl;

for(int i2=0 ; i2<coll.size() ; ++i2)

cout << coll[i2] << " ";

cout << endl;

}