int main(){
int N = 45;
// 递归消耗的时间
clock_t recursion_start_time = clock();
long result_recursion = fibonacci_recursion(N);
clock_t recursion_end_time = clock();
// 迭代消耗的时间
clock_t iteration_start_time = clock();
long result_iteration = fibonacci_iteration(N);
clock_t iteration_end_time = clock();
// 输出递归消耗的时间
printf("Result of recursion: %ld \nTime: %fseconds",
fibonacci_recursion(N),
(double)(recursion_end_time-recursion_start_time)/CLOCKS_PER_SEC
);
printf("\n-----------------------\n");
// 输出迭代消耗的时间
printf("Result of iteration: %ld \nTime: %fseconds",
fibonacci_iteration(N),
(double)(iteration_end_time-iteration_start_time)/CLOCKS_PER_SEC
);
return 0;
}
int _tmain(int argc, _TCHAR* argv[])
{
int a[MAX]={5,1,8,7,9,4,6,3,2,10};
int b[sizeof(a) / sizeof(int)]={};
int i;
void insertion(int*a,int n);//函数声明
void selection(int *a, int n);
void bubble(int *a, int n);
void quick(int *a, int low,int high);
int su_sum(int n);
void shell(int *a, int n);
void merge(int *a,int *b, int first, int last);
int fibonacci_iteration(int n);
int fibonacci_recurrence(int n);
printf("%d \n",su_sum(MAX));
printf("%d \n",fibonacci_iteration(MAX));
printf("%d \n",fibonacci_recurrence(MAX));
//insertion(a,MAX);
//selection(a, MAX);
//bubble(a,MAX);
//quick(a,0,MAX-1);
//shell(a,MAX);
merge(a,b,0,MAX);
printf("after:\n");
for(i=0;i<10;i++)
{
printf("%d ",a[i]);
}
printf("\n");
getchar();
return 0;
}
