java实现折半排序算法

public static void halfSort(int[] array) {    int low, high, mid;    int tmp, j;    for (int i = 1; i < array.length; i++) {      tmp = array[i];      low = 0;      high = i - 1;      while (low <= high) {        mid = low + (high - low) / 2;        if (array[mid] > tmp)          high = mid - 1;        else          low = mid + 1;      }      for (j = i - 1; j > high; j--) {        array[j + 1] = array[j];      }      array[high + 1] = tmp;    }  }