STL sort的使用

 

#include <iostream> #include <vector> #include <time.h> using namespace std; const int vect_len = 10; const int max_value = 100; bool myfunction(int i, int j) { return (i < j); } bool myfunction1(int i, int j) { return (i > j); } struct myclass { bool operator() (int i,int j) { return (i < j); } }myobject; //print void print(vector<int>& vec) { std::vector<int>::iterator it; std::cout << "/nvector's length: " << vec.size() << " vector's content is " << endl; for(it = vec.begin(); it != vec.end(); it++) { std::cout << *it << " "; } std::cout << endl; } void sort_test() { vector<int> vect; srand((unsigned)time(NULL)); for(int i = 0; i < vect_len; i++) { int tmp = rand(); vect.push_back(tmp % max_value); } //print before sort print(vect); //sort sort(vect.begin(), vect.end(), myfunction1); //print after sort print(vect); return; } int main() { sort_test(); }

 

 

输出如下：

ewuming/tmp>g++ -o a.out sort_test.cc
ewuming/tmp>./a.out
 
vector's length: 10 vector's content is
16  41  11  88  9  85  7  18  20  35
 
vector's length: 10 vector's content is
88  85  41  35  20  18  16  11  9  7