二分查找

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;
}