import java.util.Arrays; class InsertionSort{ public static int[] insertionSort02(int[] arr){ for(int i = 0; i < arr.length; i++){ int temp = arr[i]; for(int j = i; j >=0; j--){ if(j > 0 && arr[j-1] > temp){ arr[j] = arr[j-1]; } else { arr[j] = temp; break; } } System.out.println(Arrays.toString(arr)); } return arr; } public static void main(String[] args) { System.out.println(Arrays.toString(insertionSort02(new int[]{30,20,10,25,15,28}))); } }
直接插入排序的思想