void shellsort(int v[], int n)
{
int gap;
int i, j;
int temp;
for (gap = n / 2; gap > 0; gap /= 2)
for (i = gap; i < n; i++)
for (j = i - gap; j >= 0 && v[j] > v[j + gap]; j -= gap)
{
temp = v[j];
v[j] = v[j + gap];
v[j + gap] = temp;
}
}
希尔排序
最新推荐文章于 2025-01-21 00:21:24 发布