菜鸟学排序----折半插入排序

public void binarySort(int[] array) {for (int i = 1; i < array.length; i++) {int temp = array[i];int beginIndex = 0;int endIndex = i - 1;while (beginIndex <= endIndex) {int midIndex = (beginIndex + endIndex) / 2;if (temp < array[midIndex]) {endIndex = midIndex - 1;} else {beginIndex = midIndex + 1;}}for (int j = i; j >= beginIndex + 1; j--) {array[j] = array[j - 1];}array[beginIndex] = temp;}}}