Java实现希尔排序
private static void ShellSort(int[] arr) {
int length = arr.length;
int aug = length / 2;
while (aug > 0) {
for (int i = aug; i < length; i++) {
int temp = arr[i];
int j = i - aug;
while (j >=0 && temp < arr[j]) {
arr[j + aug] = arr[j];
j -= aug;
}
arr[j + aug] = temp;
}
aug /= 2;
}
}