折半插入排序

// 折半插入排序private static void dicInsertSort(int[] a) {for (int i = 1; i < a.length; i++) {int start = 0;int end = i - 1;while (start <= end) {int middle = start + (end - start) / 2;if (a[middle] > a[i]) {end = middle - 1;} else {start = middle + 1;}}int key = a[i];for (int j = i - 1; j >= end + 1; --j)a[j + 1] = a[j]; // 记录后移a[end + 1] = key; // 插入}}