【排序】插入排序

package leetcode.a;

public class InsertionSort {
    public static void main(String[] args) {
        int[] array = {4, 3, 2, 10, 12, 1, 5, 6};
        insertionSort(array);
        for (int i : array) {
            System.out.println(i);
        }
    }

    /**
     * 插入排序
     * @param array     入参数组
     */
    public static void insertionSort(int[] array) {
        //获取数组长度
        int n = array.length;
        int temp;
        //外层循环，从1到n
        for (int i = 1; i < n; i++) {
            //内层循环，将i左侧值升序排列
            for (int j = i; j > 0; j--) {
                if(array[j] < array[j - 1]){
                    temp = array[j];
                    array[j] = array[j - 1];
                    array[j - 1] = temp;
                }
            }
        }
    }
}