写一段希尔排序算法代码 用java

public class ShellSort {
public static void sort(int[] arr){
int n = arr.length;
int gap = n/2; //设置初始步长

while(gap > 0){
for(int i = gap; i < n; i++){
int temp = arr[i];
int j = i;

while(j >= gap && arr[j - gap] > temp){
arr[j] = arr[j - gap];
j -= gap;
}

arr[j] = temp;
}

gap /= 2; //缩小步长
}
}
}