版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/sun11462/article/details/47805553
二分查找java实现
public class BinarySearch {
public static void main(String[] args) {
int [] a={0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
BSearch(a,100);
}
private static void BSearch(int [] a ,int i) {
int low,high,mid;
low=0;
high=a.length -1;
mid=low+(high-low)/2;
while(low<high){
if(a[mid]==i){
System.out.println("查找的位置为"+mid);
break;
}else if(a[mid]<i){
low=mid+1;
mid=low+(high-low)/2;
}else{
high=mid-1;
mid=low+(high-low)/2;
}
}
if(a[mid]!=i){
System.out.println(i+"没有在数组之中");
}
}
}