3.插入排序

/**
 * 插入排序
 */
public class InsertionSort {

    public static int[] insertionSortFun(int[] nums) {
        int length = nums.length;

        for (int i = 1; i < length; i++) {

            //寻找合适的位置插入
            for (int j = i; j > 0 && nums[j] < nums[j - 1]; j--) {
                int a = nums[j];
                nums[j] = nums[j - 1];
                nums[j - 1] = a;
            }
        }

        return nums;
    }

    public static void main(String[] args) {
        int[] nums = RandomBase.random(10, 5, 40);
        System.out.println(Arrays.toString(nums));
        System.out.println(Arrays.toString(insertionSortFun(nums)));
    }

}

   public static int[] insertionSortFun1(int[] nums) {
        int length = nums.length;

        for (int i = 1; i < length; i++) {
            int num = nums[i];
            int j;
            //寻找合适的位置插入
            for (j = i; j > 0 && nums[j - 1] > num; j--) {
                nums[j] = nums[j - 1];
            }
             nums[j] =num;
        }
        return nums;
    }