package cn.itcast.algorithm.suanFa;
import java.util.Arrays;
public class MainS14 {
public static void main(String[] args) {
int[] a = {3, 1, 5, 4, 6, 9, 8, 7, 2};
insert(a);
}
private static void insert(int[] a) {
//i代表插入元素的索引
for (int i = 1;i < a.length;i++){
int t = a[i];//代表待插入元素的值
int j = i - 1;//代表已排序区的元素索引
while(j >= 0){
if (t < a[j]){
a[j + 1] = a[j];
}else{
break;//退出循环,减少比较次数
}
j--;
}
a[j+1] = t;
System.out.println(Arrays.toString(a));
}
}
}



