希尔排序算法

//希尔排序算法 时间复杂度:o(nlogn)~o(n^2),最好情况o(n^(1/3)) 最坏情况o(n^2) 不稳定
        int[] ins = {2, 1, 3, 4, 6, 5, 7, 8, 0,0};
        int increment=ins.length;
        int j;
        do {
            increment = increment / 3 + 1;
            for (int i = increment; i <ins.length ; i++) {
                int temp = ins[i];
                if(ins[i-increment]>ins[i]){
                    //交换
                    ins[i] = ins[i - increment];
                    //此处最难理解,也是核心,它是依据当前的temp,和跨度increment,一直往前找,做对比,小就交换.
                    for ( j = i- increment; j >=0 && temp<ins[j] ; j-=increment) {
                        ins[j + increment ] = ins[j];
                    }
                    ins[j + increment] = temp;
                }
            }
        } while (increment > 1);