八种排序算法

1.插入排序—直接插入排序(Straight Insertion Sort)

算法逻辑：

代码实现：

public static void InsertSort(int a[]) {
        int n = a.length;
        for (int i = 1; i < n; i++) {
            int j = i - 1;
            int x = a[i];        
            while (j >= 0 && x < a[j]) {
                a[j + 1] = a[j];
                j--;                   //元素后移
            }
            a[j + 1] = x;         //插入到正确位置
        }
        System.out.println(Arrays.toString(a));
    }

2、希尔排序

static void ShellSort(int array[]) {
    int len = array.length;
    for (int h = len / 2; h > 0; h = h / 2) {
        for (int i = h; i < len; i++) {
            int temp = array[i];
            int j = i;
            if (array[j] < array[j - h]) {
                while (j - h >= 0 && array[j] < array[j - h]) {
                    array[j] = array[j-h];
                    j -= h;
                }
                array[j] = temp;
            }
        }
    }
    System.out.println(Arrays.toString(array));
}