二分法要求,有序
分治法:
每次都和中间数字比,不断2分。
int BinarySearch(int a[],int low,int high,int target){
if(low > high)
return -1;
int mid = (low + high)/2;
if(a[mid] > target)
return BinarySearch(a,low,mid-1,target);
if(a[mid] < target)
return BinarySearch(a,mid+1,high,target);
return mid;
}