int bsearch(int A[], int l, int r,int a) {
int m = (l + r) / 2;
if (A[m] == a) return m;
else if (A[m] > a) bsearch(A, l, m, a);
else bsearch(A, m, r, a);
return -1;
}
二分查找
最新推荐文章于 2017-08-12 17:09:09 发布
int bsearch(int A[], int l, int r,int a) {
int m = (l + r) / 2;
if (A[m] == a) return m;
else if (A[m] > a) bsearch(A, l, m, a);
else bsearch(A, m, r, a);
return -1;
}