想给自己初步完成的相空间搜索算法计算一下运行时间，于是尝试了如下使用 time_t 类型的方式
?
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
|
#include <stdlib.h>
#include <iostream>
#include <time.h>
#include "StateFunctions.h"
using namespace std;
int main(int argc, char** argv)
{
time_t start, finish;
time(&start);
StateFunctions testobj(22, 22);
testobj.TEST();
testobj.TEST();
testobj.FillRandomDets(200);
testobj.evolute(1000, 0.9);
cout << "--------------------------------------------" << endl;
time(&finish);
double duration = difftime(finish, start);
cout << "--> time: " << duration << " s" << endl;
cout << "--------------------------------------------" << endl;
return 0;
}
|
这种实现方式可以正确计算出算法的核心部分耗费了234秒的 walltime。在此之前尝试的使用 clock_t 类型的实现方式是
?
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
|
#include <iostream>
#include <time.h>
#include "StateFunctions.h"
using namespace std;
int main(int argc, char** argv)
{
clock_t start, finish;
start = clock();
StateFunctions testobj(22, 22);
testobj.TEST();
testobj.TEST();
testobj.FillRandomDets(200);
testobj.evolute(1000, 0.9);
cout << "--------------------------------------------" << endl;
finish = clock();
double duration = (double)(finish - start) / CLOCKS_PER_SEC;
cout << "--> time: " << duration << " s" << endl;
cout << "--------------------------------------------" << endl;
return 0;
}
|
