demo:
#include <iostream>
void shellSort(int a[], int size) {
int increase = size / 2;
int i = 0, j = 0, k = 0, p = 0;
for (; increase > 0; increase = increase / 2) {
for (i = 0; i + increase < size; i++) {
for (p = i; p < size; p += increase) {
int tmp = a[p];
for (j = p; j >= increase; j = j - increase) {
if (a[p] > a[j - increase]) {
break;
}
}
for (k = p; k > j; k -= increase) {
a[k] = a[k - increase];
}
a[j] = tmp;
}
}
}
for (i = 0; i < size; i++) {
std::cout << a[i] << ",";
}
std::cout << std::endl;
}
int main(int agrc, char* agrv[]) {
int a[] = {33, 2, 88, 123, 34, 2};
shellSort(a, 6);
return 0;
}
上面的代码还可以进一步精简,以后有时间再改吧;
个人感觉写希尔排序还是很容易出错,主要是不小心就数组越界,或者把“=<”写成“<”而漏掉一些元素;
希尔排序最差的时间复杂度是O(N²), 使用好的增量序列可以达到O(N⅔)(不是特别确定)。