java 排序3 插入排序

/**
* 插入排序
*/
public static void insertSort() {
int[] arry = { 5, 10, 6, 8, 9, 12, 3, 1 };
System.out.println(Arrays.toString(arry));

for (int i = 1; i < arry.length; i++) {
int temp = arry[i];
int j = i - 1;
// 内层 取一个数据出来插入到前面的有序数组里
for (; j >= 0; j--) {
if (temp > arry[j]) {
arry[j + 1] = temp;
break;
} else {
arry[j + 1] = arry[j];
}
}
if (j == -1) {
arry[j + 1] = temp;
}
System.out.println(Arrays.toString(arry));
}

}

转载于:https://www.cnblogs.com/harry-Consonance/p/6594816.html