void ShellSort(int a[], int n)
{
int i,j;
int d = n;
int itmp;
while (d>= 1)
{
for ( i = d; i < n; i++)
{
if (a[i-d] > a[i])
{
itmp = a[i];
j = i - d;
do
{
a[j+d] = a[j];
j = j-d;
} while (itmp < a[j]);
a[j+d] = itmp;
}
}
d = d/2;
}
}
shell排序
最新推荐文章于 2022-08-21 20:51:14 发布