写一段Java代码 实现希尔排序
时间: 2023-03-14 13:32:21 浏览: 57
public class ShellSort {
public static void sort(int[] arr) {
int n = arr.length;
for (int gap = n/2; gap > 0; gap /= 2) {
for (int i = gap; i < n; i += 1) {
int temp = arr[i];
int j;
for (j = i; j >= gap && arr[j - gap] > temp; j -= gap)
arr[j] = arr[j - gap];
arr[j] = temp;
}
}
}
public static void main(String args[]) {
int arr[] = {12, 34, 54, 2, 3};
System.out.println("排序前");
for (int i=0; i<arr.length; ++i)
System.out.print(arr[i] + " ");
sort(arr);
System.out.println("\n排序后");
for (int i=0; i<arr.length; ++i)
System.out.print(arr[i] + " ");
}
}