希尔排序

import com.sun.tools.javac.Main;

/**
 * @author 许泽鑫
 * @data 2019/11/13 - 10:08
 */
public class shellsort {
    public int[] ShellSort(int[]a){
        int N = a.length;
        for(int group = N/2;group > 0;group = group /2){
            for(int i = group;i<N;i++){
                insersort1(a,group,i);

            }

        }
        return a;
    }
    public void insersort1(int[]a,int group,int i){
        int inserNum = a[i];
        int j = i - group;
        while (j >= 0 && a[j] > a[i]) {
            a[i] = a[j];
            j -= group;
        }
        a[j+group] = inserNum;
    }

    public static void main(String[] args) {
        shellsort s = new shellsort();
        int[] a = new int[]{10,4,5,3,8,6};
        s.ShellSort(a);
        for (int i = 0;i<a.length;i++){
            System.out.println(a[i]);
        }
    }
}