三、插入排序
package com.xu.Array;
import java.util.Arrays;
public class Demo06 {
public static void main(String[] args) {
int[] arr=new int[5];
for(int i=0;i<arr.length;i++){
arr[i]=(int)(Math.random()*100);
}
System.out.println("排序前:"+ Arrays.toString(arr));
insertSort(arr);
System.out.println("排序后:"+ Arrays.toString(arr));
}
private static void insertSort(int[] a) {
int len = a.length;
for (int i = 1; i < len; i++) {
int insertNum = a[i];
int j = i - 1;
while (j >= 0 && a[j] > insertNum) {
a[j + 1] = a[j];
j--;
}
a[j + 1] = insertNum;
}
}
}