希尔排序（含插入排序）

package PTAPractice;

public class shellSort {
    public static void main(String[] args) {
        int[] arr = {10,8,11,7,4,12,9,6,5,3};
        int[] arr1={15,5,2,7,12,6,1,4,3,9,8,10};
        shellSort(arr1,10);
        printArr(arr1);
        //insertion(arr);

    }

    public static void shellSort(int[] arr, int len) {

        int i, j, inc, key;
        // 初始增量：len/2，每一趟之后除以二
        for (inc = len / 2; inc > 0; inc /= 2) {
            insertion(arr);
//            // 每一趟采用插入排序
//            for (i = inc; i < len; i++) {
//                key = arr[i];
//                for (j = i; j >= inc && key < arr[j - inc]; j -= inc)
//                    arr[j] = arr[j - inc];
//                arr[j] = key;
//            }

        }
    }

    public static void insertion(int[] arr) {
        for (int i = 1; i < arr.length; i++) {
            int key = arr[i];
            int j = i - 1;
            while (j >= 0 && arr[j] > key) {
                arr[j + 1] = arr[j];
                j--;
            }
            arr[j + 1] = key;

        }

//        int i,j,inc=0,key;
//        for (i = inc; i < arr.length; i++) {
//            key=arr[i];
//            for(j=i;j>=inc && key<arr[j-inc];j-=inc){
//                arr[j]=arr[j-inc];
//            }
//            arr[j]=key;
//        }
    }
    public static void printArr(int[] arr){
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i] + " ");
        }
        System.out.println();
    }
}