InsertionSort
public class InsertionSort {
public static void insertionSort(int[] arr){
//外层循环起到遍历作用
for (int i = 0; i < arr.length; i++) {
if(i+1< arr.length&&arr[i]>arr[i+1]) {
swap(arr,i,i+1);
//内层循环：起到再调整作用（自创名词）
for(int j=i;j>0;j--) {
if(arr[j-1]>arr[j]){
swap(arr,j-1,j);
}else
break;
}
}
}
}
private static void swap(int[] arr,int i,int j){
int k=arr[i];
arr[i]=arr[j];
arr[j]=k;
}
public static void main(String[] args) {
int[] arr={10,4,3,1,2,5,7,6,8,9};
insertionSort(arr);
System.out.println("插入排序后的arr数组");
System.out.print("[");
for (int i = 0; i < arr.length; i++) {
if(i<arr.length-1)
System.out.print(arr[i]+",");
else
System.out.print(arr[i]);
}
System.out.print("]");
}
}