每日一题——二分查找
public int BinarySearch(int[] a, int x) {
int low=0,high=a.length-1,mid=0;
if&nbsp;(x<a[low]||x>a[high]||low>high)&nbsp;{
return&nbsp;-1;
}
while&nbsp;(low<=high)&nbsp;{
mid=(low+high)/2;
if&nbsp;(a[mid]<x)&nbsp;{
low=mid+1;
}else&nbsp;if&nbsp;(a[mid]>x)&nbsp;{
high=mid-1;
}
else&nbsp;{
return&nbsp;mid;
}
}
return&nbsp;-1;
}
}

面试差点没写出来&mdash;&mdash;干！