插入排序

public class InsertSort {
    public static void main(String[] args) {
        int[] arr = {500, 465, 78, 99, 3, 64};
        insertSort(arr);
    }

    public static void insertSort(int[] arr) {
        int insertValue = 0;
        int insertIndex = 0;
        for (int i = 1; i < arr.length; i++) {
            //定义带插入数
            insertValue = arr[i];
            insertIndex = i - 1;
            while (insertIndex >= 0 && insertValue < arr[insertIndex]) {
                arr[insertIndex + 1] = arr[insertIndex];
                insertIndex--;
            }
            //退出循环时 插入的位置找到
            if (insertIndex + 1 != i) {
                arr[insertIndex + 1] = insertValue;
            }

        }
        System.out.println(Arrays.toString(arr));
    }
}