其实手动实现二分查找算法,跟java.util.Arrays中的binarySearch(int[] ,int key);的算法一样
只不过源码中是
mid = (low + up) >>> 1;
public static int binarySearch(int[] array, int val) {
int low = 0;
int up = array.length - 1;
int mid = 0;
while (low < up) {//只要low小于up就可以一直折半
mid = (low + up) >> 1;//相当于除以2
if (array[mid] == val)//一开始就命中,直接返回
return mid;
else if (array[mid] < val)
low = mid + 1;
else
up = mid - 1;
}
return -(low+1);//返回要插入的位置,不是下标
}