折半查找
public class Demo5 {
public static void main(String[] args) {
int[] a = {0,11,34,40,56,60,87,100};
int t = 87;
//起始的检索位置
int start = 0;
//结束的检索位置
int end = a.length;
//中间数位置
int mid = -1;
while(start <= end){
//计算获取中间数位置
mid = (start + end) / 2;
if(t > a[mid]){
start = mid;
}else if(t < a[mid]){
end = mid;
}else{
System.out.println("目标数在数组的位置是:"+mid);
break;
}
}
}