public class insertSortTest {
public static void main(String[] args) {
int [] arr={14,78,26,34,67,56,90,89};
for(int i=1;i<arr.length;i++){// n-1趟,依次向前插入n-1个数
int x=arr[i],j; // 每趟将keys[i]插入到前面排序子序列中
for(j=i-1;j>=0&&x<arr[j];j--){
arr[j+1]=arr[j];
arr[j]=x; //x值到达插入位置
}
}
System.out.println(Arrays.toString(arr));
}
}
01-05
308
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
08-03
223
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
03-13
466
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
02-09
580
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)