/** * 直接插入排序 * @param src * @return */ public static int[] straightInsertionSort(int [] src){ for (int i = 1; i< src.length; i++){//外层循环,需要插的次数 for (int j = i; j >= 1; j--){//内循环往前插 if (src[j] < src[j-1]){ int temp = src[j]; src[j] = src[j-1]; src[j-1] = temp; } } } return src; }