#include <time.h>
#include <iostream>
using namespace std;
#include <list>
#include <vector>
#include <algorithm>
int main()
{
srand(time(0));
const int N = 1000;
vector<int> v;
v.reserve(N);
list<int> lt2;
for (int i = 0; i < N; i++)
{
auto e = rand();
v.push_back(e);
lt2.push_back(e);
}
int begin1 = clock();
sort(v.begin(), v.end());
int end1 = clock();
int begin2 = clock();
lt2.sort();
int end2 = clock();
cout << "vector sort:" << end1 - begin1 << endl;
cout << "list sort:" << end2 - begin2 << endl;
}
N个数据需要排序,vector+算法sort和list+sort的效率比较
最新推荐文章于 2024-07-15 20:47:50 发布