直接插入排序

#include<stdio.h>

void straight_insert_sort(int *a, int n)
{
    int i,j;
    for(i = 1; i < n; i++)
    {
        if(a[i] < a[i-1])
        {
            int temp = a[i];
            for(j = i - 1; j >= 0 && a[j] > temp; j--)
                a[j+1] = a[j];
            a[j+1] = temp;
        }
    }
}
int main()
{
    int a[] = {70,30,40,10,80,20,90,100,75,60,45};
    int n = sizeof(a) / sizeof(*a);
    straight_insert_sort(a,n);
    for(int i = 0; i < n; i++)
        printf("%d ",a[i]);
    return 0;
}

直接插入排序

原文：https://www.cnblogs.com/AdvacneQxj/p/12826630.html