在一个升序数组中,插入一个数仍然是升序

import java.util.Scanner;

public class Arrayadd {
    public static void main(String[] args) {
        int[] arr = {10,15,50,66};
        //int insertnum = 40;//可引入Scanner 自己键入值
        int index = -1;//index  就是要插入的位置
        Scanner scanner = new Scanner(System.in);
        System.out.println("输入数字");
        int insertnum =  scanner.nextInt();
        for (int i = 0; i < arr.length; i++) {
            if (insertnum <= arr[i]) {
                index = i;
                break;
            }
        }
        if (index == -1) {
            index = arr.length;
        }
        int[] arrnew = new int[arr.length + 1];
        for (int i = 0,j = 0; i