Title: there is an array that has been sorted in ascending order. Now enter a number and ask to insert it into the array according to the original rule.

< Tips > Program analysis ： First, determine which element in the array this number is smaller than for the first time , Then insert this number , The number after this element is inserted , Move one back in turn

int[] nums = new int[5];
		nums[0]=2;
		nums[1]=5;
		nums[2]=8;
		nums[3]=9;
//		 Enter a number on the keyboard 
		Scanner iput = new Scanner(System.in);
		System.out.println(" Please enter a number ：");
		int insert = iput.nextInt();
		int index = nums.length -1;
		System.out.println(" Array before insertion ：");
		for (int i : nums) {
			System.out.print(i+" ");
		}
		System.out.println();
//		 obtain , Substitute subscript 
		for(int i = 0;i<nums.length;i++){
			if(insert<nums[i]){
				index=i;
				break;
			}
		}
//		 Others move backwards 
		for(int i = nums.length-1;i>index;i--){
			nums[i]=nums[i-1];
		}
//		 Insert this data 
		nums[index]=insert;
		System.out.println(" Array after insertion ：");
		for (int i : nums) {
			System.out.print(i+" ");
		}
		System.out.println(" It's time to accept it. I like it desperately ");