#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
bool cmp(int a, int b)
{
return true;
}
int main()
{
vector<int>Q;
for(int i = 1; i <= 10; i++)Q.push_back(rand());
for(int i = 0; i < Q.size(); i++)
cout <<Q[i]<<" ";
cout << endl;
sort(Q.begin(),Q.end(),cmp);
for(int i = 0; i < Q.size(); i++)
cout <<Q[i]<<" ";
cout << endl;
sort(Q.begin(),Q.end(),cmp);
for(int i = 0; i < Q.size(); i++)
cout <<Q[i]<<" ";
cout << endl;
sort(Q.begin(),Q.end(),cmp);
for(int i = 0; i < Q.size(); i++)
cout <<Q[i]<<" ";
cout << endl;
return 0;
}
你能猜到上面会是什么样的结果么 ?? 逆序效果
bool cmp(int a, int b)
{
return false;
}
改成false之后,将保持原序