插入排序原理:
![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/1528a35c88238611254414e28936e116.png)
public static void main(String[] args) {
Integer[] array = {null,5,2,4,6,1,3};
System.out.println("排序前:");
for (int i=1;i<array.length;i++){
System.out.println(array[i]+" ");
}
for(int i=2;i<array.length;i++){
if(array[i] < array[i-1]){
array[0] = array[i];
array[i] = array[i-1];
int insert = 0;
for (int j = i-2;j>=0;j--){
if(array[j] > array[0]){
array[j+1] = array[j];
}else{
insert = j + 1;
break;
}
}
array[insert] = array[0];
}
}
System.out.println("排序后");
for (int i=1;i<array.length;i++){
System.out.println(array[i]+" ");
}
}