int BSearch(int al int x, int low, int high) Int mi id if(low >high)return-1; 查找不成功 mid=(low t high)/2; if(x= amid) return mid;/查找成功 else if(x a midd return BSearch(a, x, low, mid-1); /在庄下半区查找 ese return bsearch(a,x,mid1,high);在上半区查找11 int BSearch(int a[], int x, int low, int high) { int mid; if(low > high) return -1; //查找不成功 mid = (low + high) / 2; if(x == a[mid]) return mid; //查找成功 else if(x < a[mid]) return BSearch(a, x, low, mid-1); //在下半区查找 else return BSearch(a, x, mid+1, high); //在上半区查找 }