【算法】插入排序 insert sort algorithm

#include <stdlib.h>
#include <stdio.h>
#include <string.h>

void main()
{
        int a[10] = {9, 8, 7, 6, 5, 4, 3, 2, 1, 0};
        int key = 0;
        int j = 0;
        for (j = 1; j < sizeof(a)/sizeof(int); j++)
        {
                key = a[j];
                int i = j-1;
                while ((i>=0)&&(a[i]>key))
                {
                        a[i+1]=a[i];
                        i--;
                }
                a[i+1] = key;
        }

        for (j=0; j < sizeof(a)/sizeof(int); j++)
        {
                printf("%2d\n", a[j]);
        }
        return;
}