希尔排序(交换法):
//希尔交换法
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;
}
}
}
}