Java数组动态插入排序

package homework;

import java.util.Scanner;

public class InsertionSort {

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);

		int[] originArr = { 1, 2, 3, 5, 6, 7, 8, 9, 0 };
		int[] newArr = new int[originArr.length + 1];
		System.out.print("请输入一个数进行插入排序：");
		newArr[0] = sc.nextInt();

		int index = 0; // 原数组的起始下标
		for (int i = 1; i < newArr.length; i++) {
			newArr[i] = originArr[index];
			index++;
		}

		for (int i = 0; i < newArr.length; i++) {
			for (int j = i + 1; j < newArr.length; j++) {
				if (newArr[i] > newArr[j]) {
					int temp = newArr[i];
					newArr[i] = newArr[j];
					newArr[j] = temp;
				}
			}
		}
		
		System.out.println("\n排序后的结果为：");
		for (int i = 0; i < newArr.length; i++) {
			System.out.print(newArr[i] + "    ");
		}

		sc.close();

	}

}