Java版 数据结构-shell排序

import java.util.Arrays;

public class ShellSort {
    public static void main(String[] args) {
        int[] arr = new int[]{8,6,9,4,0,2,7,1,3,5};
        shellSort(arr);
    }
    public static void shellSort(int[] arr){
        int temp=0;
        int count =0;
        for (int gap = arr.length/2; gap>0; gap/=2) {
            for (int i = gap; i < arr.length; i++) {
                for (int j = i-gap; j>=0;j-=gap) {
                    if (arr[j]>arr[j+gap]){
                        temp= arr[j];
                        arr[j]=arr[j+gap];
                        arr[j+gap]=temp;
                    }
                }
            }
            System.out.println("这是第"+(count++)+"次排序");
            System.out.println(Arrays.toString(arr));
        }
    }
}