希尔排序1

int printA(int a[],int len)//打印
{
int i;
for(i = 0; i<len;i++)
{
printf("%d\n",a[i]);
}
}

int main()
{
int i,j,get;
int a[5] = {2,3,1,6,9};
int len = sizeof(a)/sizeof(a[0]);
int d = 0;
while(d<len)
{
d = d*3+1;
}
while(d > 3)
{
for(i=1;i<len;i++)
{
get = a[i];
j = i-d;
while(j>=0 && a[j]>get)
{
a[j+d] = a[j];
j = j-d;
}
a[j+d] = get;
}
d = (d-1)/3;
}
printA(a,len);
}