算法时间复杂度 基于cloock()或time()（直接把clock全部转换成time即可）

# include<stdio.h>
# include <time.h>


void add(int n)
{
int i, j, k, x;


x = 1;
for (i = 1; i <= n; i++)
for (j = 1; j <= i; j++)
for (k = 1; k <= j; k++)
x++;
}


void hanoi(int disc, int start, int temporary, int goal)
{
if (disc == 1)
printf("%d -> %d\n", start, goal);
else
{
hanoi(disc - 1, start, goal, temporary);
hanoi(1, start, temporary, goal);
hanoi(disc - 1, temporary, start, goal);


}
}






int main(){
int x,n,t,T;
printf("请输入x的值：");
scanf_s("%d", &x);
printf("请输入n的值：");
scanf_s("%d", &n);
time_t t1,t2,t3,t4;
t1 = clock(NULL);
add(x);
t2 = clock(NULL);
t = t2 - t1;
printf("执行所需的时间为：%d\n", t);
t3 = clock(NULL);
hanoi(n,1,2,3);
t4 = clock(NULL);
T = t4 - t3;
printf("起始时刻为：%d\n",t3);
printf("终止时刻为：%d\n", t4);
printf("执行所需的时间为：%d", T);
}