【无标题】

#include
#include#include#include#include#include#includeusing namespace std;int L[1000000];int N = 88874;int main(){ vectorv; listl; sets; for (int i = 0; i < 1000000; i++) { L[i] = rand(); } for (int i = 0; i < 1000000; i++) { v.push_back(L[i]); l.push_back(L[i]); s.insert(L[i]); } clock_t start_1 = clock();//计时开始 vector::iterator it_1 = v.begin(); for (; it_1 != v.end(); it_1++) { if (*it_1 == N) { break; } } clock_t end_1 = clock();//计时结束 clock_t start_2 = clock();//计时开始 vector::iterator it_2 = find(v.begin(), v.end(), N); clock_t end_2 = clock();//计时结束 clock_t start_3 = clock();//计时开始 list::iterator it_3 = find(l.begin(), l.end(), N); clock_t end_3 = clock();//计时结束 clock_t start_4 = clock();//计时开始 set::iterator it_4 = s.find(N); clock_t end_4 = clock();//计时结束 cout << “基于迭代器的遍历查找算法的查找时间消耗：” << end_1 - start_1 << “ms” << endl; cout << “vector的查找时间消耗：” << end_2 - start_2 << “ms” << endl; cout << “list的查找时间消耗：” << end_3 - start_3 << “ms” << endl; cout << “set的查找时间消耗：” << end_4 - start_4 << “ms” << endl; return 0;}