希爾排序(交換法):
//希爾交換法
public static void jShellSort(int[] arr) {
int temp = 0;
//第一輪將n個數據分成了arr.length/2組
for (int stap = arr.length / 2; stap > 0; stap /= 2){
for (int i = stap; i < arr.length; i++) {
//遍歷各組元素,步長:arr.length/2
for (int j = i - stap; j >= 0; j -= stap) {
if (arr[j] > arr[j + stap]) {
temp = arr[j];
arr[j] = arr[j + stap];
arr[j + stap] = temp;
}
}
}
//System.out.println(Arrays.toString(arr));
}
}
希爾排序(移位法):
//希爾移位法
public static void yShellSort(int[] arr) {
for (int stap = arr.length / 2; stap > 0; stap /= 2) {
for (int i = stap; i < arr.length; i++) {
int j = i;
int temp = arr[j];
if (arr[j] < arr[j - stap]) {
while (j - stap >=0 && temp < arr[j - stap]) {
arr[j] = arr[j - stap];
j -= stap;
}
//當退出while循環就找到位置
arr[j] = temp;
}
}
}
}