希尔排序

#include <stdio.h>

void sort(int a[], int length)
{
        for (int gap = length / 2; gap > 0; gap /= 2)
                for (int i = gap; i < length; i++)
                        for (int j = i - gap; j >= 0 && a[j] > a[j + gap]; j -= gap)
                        {
                                int temp = a[j];
                                a[j] = a[j+gap];
                                a[j+gap] = temp;
                        }
}

void main()
{
        int a[] = {5,2,3,4,0,9,8,7,1,6};
        int length = sizeof(a)/4;
        sort(a,length);
        for(int i=0;i<length;i++)
        {
                printf("a[%d] = %dn",i,a[i]);
        }
}