private static void insertSort(int[] array) { if (array == null || array.length < 1) { return; }
//int[] array = {6, 3, 5, 7, 2, 4, 1, 0, 9, 8}; //外循环负责拿数内循环负责比较排序 //拿出3跟6比,3比6小,6往后移一位3插入到六的位置 {3, 6, 5, 7, 2, 4, 1, 0, 9, 8} //拿5跟6比,6往后移动,再跟3比,3不动 {3, 5, 6, 7, 2, 4, 1, 0, 9, 8} //拿7跟6比,6不动 {3, 5, 6, 7, 2, 4, 1, 0, 9, 8
for (int i = 1; i < array.length; i++) { int temp = array[i]; int i1; for (i1 = i - 1; i1 >= 0; i1--) { if (array[i1] > temp) { array[i1 + 1] = array[i1]; } else { break; } } array[i1+1] = temp; }