1.先设置栏目【工具】的【编译选项】
![](https://i-blog.csdnimg.cn/blog_migrate/fe7f022ccdbc8750b7db177d4834613a.png)
2.填写红框的内容并勾选方框(不进行这一步会报错)
![](https://i-blog.csdnimg.cn/blog_migrate/51f4a35a1eee92b5217c5bcc89a3fd18.png)
3.通过一个程序测试计算机1s可以处理多大数量级的数据
#include <iostream>
#include <chrono>
#include <thread>
using namespace std;
using namespace chrono;
//O(n)
void function1(long long n){
long long k = 0;
for (long long i = 0; i < n; i++){
k++;
}
}
//O(n^2)
void function2(long long n){
long long k = 0;
for (long long i = 0; i < n; i++){
for (long j = 0; j < n; j++){
k++;
}
}
}
//O(nlogn)
void function3(long long n){
long long k = 0;
for (long long i = 0; i < n; i++){
for (long j = 1; j < n; j = j*2){
k++;
}
}
}
//主函数
int main(){
long long n;
while (1){
cout << "输入n:";
cin >> n;
milliseconds start_time = duration_cast<milliseconds>(
system_clock::now().time_since_epoch()
);
function1(n);
//function2(n);
//function3(n);
milliseconds end_time = duration_cast<milliseconds>(
system_clock::now().time_since_epoch()
);
cout << "耗时:" << milliseconds(end_time).count() - milliseconds(start_time).count() << "ms" << endl;
}
}
O(n)运行结果:
![](https://i-blog.csdnimg.cn/blog_migrate/3c87fe96ba654c3694326ecde17f2cf3.png)
O(n^2)运行结果:
![](https://i-blog.csdnimg.cn/blog_migrate/4b6d4d7bf076a449081013dd392ef78e.png)
O(nlogn)运行结果:
![](https://i-blog.csdnimg.cn/blog_migrate/ae7c3ea705d8712084be61169e81d24c.png)