图解插入排序

        int[] arr = new int[]{3, 5, 11, 2, 8};
        for (int i=0; i< arr.length-1; i++){
            int insertEle = arr[arr.length-1];
            int sortArrLimit = i;
            int willSortArrLimit = i+1;
            int tempPosition = willSortArrLimit;

            //其他元素后移
            for(int j=arr.length-1; j> willSortArrLimit; j--){
                arr[j] = arr[j-1];
            }

            //寻找插入位置
            for (int j= 0; j<=sortArrLimit; j++ ){
                if (insertEle > arr[j]){
                    tempPosition = j;
                    break;//找到位置之后要中断掉，有序数组是个逆序的数组
                }
            }

            //执行插入动作
            for (int j=willSortArrLimit; j>tempPosition; j--){
                arr[j] = arr[j-1];
            }
            arr[tempPosition] = insertEle;
        }
        System.out.println(Arrays.toString(arr));