package shuanfazhidao.base.ch02;
import java.util.Scanner;
public class InsertionSort_A {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
System.out.println("请输入数组大小:");
int n = in.nextInt();
int i;
int[] a = new int[n];
System.out.println("请输入数组元素:");
for (i = 0; i < n; i++) {
a[i] = in.nextInt();
}
for (int j = 1; j < a.length; j++) {
int key = a[j];
i = j - 1;
while (i >= 0 && a[i] > key) {
a[i + 1] = a[i];
i = i - 1;
a[i + 1] = key;
}
}
System.out.println("排序后的数组为:");
for (i = 0; i < a.length; i++) {
System.out.print(a[i] + " ");
}
System.out.println();
}
}