四个排序：冒泡，选择，插入，希尔

package com.atzhanyuan.java;


/**
 * @author hylstart
 * @create 2022-01-14 13:48
 */
public class SortTest {
    public static void main(String[] args) {

        int[] arr = new int[]{2, 4, 7, 3, 6, 8, 23, 737, 7699, 116167, 0, -892689, -1};


        BubbleSortTest(arr);
        SelectSortTest(arr);
        InsertSortTest(arr);
        ShellSortTest(arr);
        

        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i] + " ");
        }
        //-892689 -1 0 2 3 4 6 7 8 23 737 7699 116167 

    }

    //冒泡排序
    static void BubbleSortTest(int[] arr){
        for (int end = arr.length - 1; end >= 0; end--){
            for (int i = 0; i < end; i++){
                if (arr[i] > arr[i + 1]){
                    int temp = arr[i];
                    arr[i] = arr[i + 1];
                    arr[i + 1] = temp;
                }
            }
        }
    }

    //选择排序
    static void SelectSortTest(int[] arr){
        for (int end = arr.length - 1; end >= 0; end--){
            int indexOfMax = 0;
            int max = arr[0];

            for (int i = 0; i <= end; i++){
                if (arr[i] > max){
                    indexOfMax = i;
                    max = arr[i];
                }
            }

            int temp = arr[indexOfMax];
            arr[indexOfMax] = arr[end];
            arr[end] = temp;
        }
    }

    //插入排序
    static void InsertSortTest(int[] arr){
        for (int i = 0; i < arr.length - 1; i++){
            int indexOfLast = i - 1;//原有手牌的最后一张的位置
            int v = arr[i];//新手牌

            while (indexOfLast > -1 && v < arr[indexOfLast]){
                arr[indexOfLast + 1] = arr[indexOfLast];
                indexOfLast--;
            }

            arr[indexOfLast + 1] = v;
        }
    }

    //希尔排序
    static void ShellSortTest(int[] arr){
        //不断地缩小增量
        for (int interval = arr.length/2; interval > 0; interval = interval/2){
            //插入排序
            for (int i = interval; i < arr.length; i++){
                int j = i - interval;
                int target = arr[i];

                while (j > -1 && target < arr[j]){
                    arr[j + interval] = arr[j];
                    j -= interval;
                }

                arr[j + interval] = target;
            }
        }
    }

}