[33, 35, 47, 55, 67, 94]
lo hi
1.定义三个下标
lo=0
hi=a.length-1
mid 先不赋值
2.当lo<=hi
3.计算中间位置mid=(lo+hi)/2
4.mid位置的值>t,hi定位到mid-1位置
5.mid位置的值<t,lo定位到mid+1位置
6.否则,直接返回mid的值
7.找不到数据,返回一个特殊值-1
private static int binarySearch(int[] a, int t) {
int lo = 0;
int hi = a.length-1;
int mid;
while(lo<=hi){
mid = (lo+hi)/2;
if(a[mid]>t){
hi = mid-1;
}else if(a[mid]<t){
lo = mid+1;
}else{
return mid;
}
}
return -1;
}