排序之插入排序

#include <stdio.h>
void InsertSort(int *a,int length);
int main()
{
    int a[8] = {5,8,7,10,25,64,3,1};
    InsertSort(a,8);
    for(int i = 0;i<8;++i)
    {
        printf("%d ",a[i]);
    }
    printf("\n");
    return 0;
}
void InsertSort(int *a,int length)
{
    int t = 0;
    
    for(int i = 1;i < length ;++i)
    {
        t = a[i];
        a[i] = a[i-1];
        int j = i;
        while(j > 0 && (t < a[j -1]))
        {
            a[j] = a[j - 1] ; 
            j--;
        }
        a[j] = t;
    }
}