C语言简单算法—希尔排序

#include "stdio.h"


void shellsort(int a[],int n);


void main()
{
int a[11] = {0,25,12,36,45,2,9,39,22,90,37};
int i;
printf("原始序列为:\n");
for(i=1;i<11;i++)
printf("%d ",a[i]);
printf("\nshell序列为:\n");
shellsort(a,11);
for(i=1;i<11;i++)
printf("%d ",a[i]);
printf("\n");
return 0;


}


void shellsort(int a[],int n)
{
int d=n/2;
int i,j;
int length=0;
while(d>=1)
{
for(i=d+1;i<=n;i++)
{
a[0] = a[i];
j = i-d;
while(j>=1&&a[0]<a[j])
{
a[j+d] = a[j];
j = j - d ;
length++;
}
a[j+d] = a[0];

}
d = d/2;
}
printf("频度:%d\n",length);
}