Question

数据结构作业：试写出递归的二分查找算法，求大神帮忙写一下代码！！

Answer 1

int BSearch(int s[], int low, int high, int key) {
int mid;
if(low > high) return 0;
mid = (low + high) / 2;
if(s[mid] == key) return mid;
if(s[mid] > key) return BSearch(s, low, mid - 1, key);
return BSearch(s, mid + 1, high, key);
}