一个已经排好序的数组。现输入一个数，要求按原来的规律将它插入数组中

//导包
import java.util.Scanner;

public class Demo09 {
    public static void main(String[] args) {
        int[] arr1 = {1, 7, 9, 14, 26, 30, 57};
        Scanner input = new Scanner(System.in);
        System.out.println("请输入要插入的数值：");
        int a = input.nextInt();
        
        //定义一个变量，用来记住插入数值的下标
        int index = 0;
        
        //定义一个新数组，长度比旧数组+1
        int[] arr2 = new int[arr1.length + 1];
        
        //将旧数组中的数组，遍历到新数组中
        for (int i = 0; i < arr1.length; i++) {
            arr2[i] = arr1[i];
            System.out.print(arr2[i] + " ");
        }
        System.out.println();
        //遍历新数组，比较插入的值，如果小于了当前数组，就将当前数组的下标给index
        for (int i = 0; i < arr2.length; i++) {
            if (a < arr2[i]) {
                index = i;
                break;
            }
        }
        
        //将index下标后的元素值，依次循环给下一个下标
        for (int i = arr2.length - 1; i > index; i--) {
            arr2[i] = arr2[i - 1];
            //System.out.print(arr2[i]+" ");
        }
        //把a赋值给下标index
        arr2[index] = a;
        //遍历此数组
        System.out.println("插入数值之后的排序：");
        for (int i = 0; i < arr2.length; i++) {
            System.out.print(arr2[i] + " ");
        }
    }
}