void shellSort(int k[], int n) {
int i, j, temp, gap;
gap = n;
do {
gap /= 2;
for (i = gap; i < n; i+=gap) {
if (k[i] < k[i - gap]) {
temp = k[i];
for (j = i - gap; k[j] > temp; j-=gap) {
k[j + gap] = k[j];
}
k[j + gap] = temp;
}
}
} while (gap > 1);
}
希尔排序
最新推荐文章于 2024-03-20 13:15:46 发布