二分查找Java实现

while(low<=high){ if(x==arr[mid]){ return mid; } else if(mid>0&&x<arr[mid]){ high=mid-1; mid=(low+high)/2; } else if(mid<arr.length-1){//若前面没有判断，则当要查找数超过arr数组中最大值时出现死循环。 low=mid+1; mid=(low+high)/2; }