直接插入排序

void straightInsert(int *arr,int length){
    int i,j,k;
    for(i=1;i<length;i++){
        if(arr[i] < arr[i-1]){
            k = arr[i]; //作为中间值存储每次的记录值
            for(j=i-1;arr[j] > k;j--){ //把大于该值的元素都向后移
                arr[j+1] = arr[j];
            }
            arr[j+1] = k;
        }
    }
}

#include <stdio.h>
#include <stdlib.h>
#include <time.h>
int arrtest1[10] = {3,4,7,8,0,9,1,2,6,5};
int arrtest2[10] = {0,1,2,3,4,5,6,7,8,9};
int arrtest3[10] = {9,8,7,6,5,4,3,2,1,0};
void copy(int *from,int *arr,int length);
void print(int *arr,int length);
void straightInsert(int *arr,int length);
int main(){
    clock_t start,end;
    int Arr[10];
    int i;
    start = clock();
    for(i=0;i<100000;i++){
        copy(arrtest1,Arr,10);
        //print(Arr,10);
        straightInsert(Arr,10);
        //print(Arr,10);
    }
    end = clock();
    printf("first test:%d\n",end-start);

    start = clock();
    for(i=0;i<100000;i++){
        copy(arrtest2,Arr,10);
        //print(Arr,10);
        straightInsert(Arr,10);
        //print(Arr,10);
    }
    end = clock();
    printf("first test:%d\n",end-start);

    start = clock();
    for(i=0;i<100000;i++){
        copy(arrtest3,Arr,10);
        //print(Arr,10);
        straightInsert(Arr,10);
        //print(Arr,10);
    }
    end = clock();
    printf("first test:%d\n",end-start);

    getchar();
    return 0;
}
void straightInsert(int *arr,int length){
    int i,j,k;
    for(i=1;i<length;i++){
        if(arr[i] < arr[i-1]){
            k = arr[i]; //作为中间值存储每次的记录值
            for(j=i-1;arr[j] > k;j--){ //把大于该值的元素都向后移
                arr[j+1] = arr[j];
            }
            arr[j+1] = k;
        }
    }
}
void copy(int *from,int *arr,int length){
    int i;
    for(i=0;i<length;i++){
        arr[i] = from[i];
    }
}

void print(int *arr,int length){
    int i;
    for(i=0;i<length;i++){
        printf("%d ",arr[i]);
    }
    printf("\n");
}