直接插入排序

来源：互联网发布：php 开源多用户商城编辑：程序博客网时间：2024/06/05 19:50

//直接插入排序

#include <stdio.h>

#include <time.h>
#define GETCOUNT(x) (sizeof(x) / sizeof((x)[0]))
void insertSort(int *a,int n){
   int tmp,j;
   for(int i=1;i<n;i++){
       tmp = a[i];
       j = i;
       while(j>0 && tmp < a[j-1]){
           a[j] = a[j-1];
           j--;
       }
       a[j] = tmp;
   }
   void print(int *a,int n){
       for(int i = 0;i<n;++i){
           printf("%d%s",a[i],i==n-1 ? "\n":" ");
       }
   }
}
int main(){
   clock_t start_t,end_t;
   start_t = clock();
   printf("Starting of the program, start_t = %ld\n",start_t);
   int a[200000];
   for(int i=0;i<200000;i++){
       a[i] = 100 - i;
   }
   int n = GETCOUNT(a);
   int i;
   insertSort(a,n);
   end_t = clock();
   printf("End of the function, end_t = %ld\n",end_t);
   double total_t = (double)(end_t - start_t) / CLOCK_PER_SEC;
   printf("Total seconds time taken by CPU: %f\n",total_t);
   return 0;
   return 0;

}

//二分插入排序

0 0