希尔排序 ShellSort Java代码

public class ShellSort {

public static void main(String[] args) {
int[] num = {3,2,1,5,4,2,8,6,12,2};
shellSort(num);
for(int i : num){
System.out.println(i);
}
}
public static void shellSort(int[] data){
int h = 1;//缩小增量
while(h<=data.length/3){
h = h*3+1;
}
while(h > 0){
for(int i = h; i < data.length; i++){
if(data[i] < data[i - h]){//需要插入
int temp = data[i];
int j = i -h;
for(;j >= 0 && data[j] > temp; j-=h){
data[j + h] = data[j];//在插入之前，整体后移
}
data[j + h] = temp;//插入
}
}
h = (h - 1) / 3;
}

}
public static void swap(int[] data, int i, int j){
int temp = data[i];
data[i] = data[j];
data[j] = temp;
}
}