二分查找（递归和非递归写法）

#include <iostream>
#include <algorithm>
using namespace std;

const int maxn = 10005;
int a[maxn];

// 递归写法
int binary_search(int a[], int x, int l, int h) {
    if(l <= h) {
        int mid = (l + h) / 2;
        if(a[mid] == x)
            return mid;
        if(a[mid] < x) {
            binary_search(a, x, (l + h) / 2 + 1, h);
        } 
        else {
            binary_search(a, x, l, (l + h) / 2 - 1);
        }
    }
    else
        return -1;
}

// 非递归写法
int b_search(int a[], int x, int l, int h) {
    int j = -1;
    while((l <= h) && (j == -1)) {
        int mid = (l + h) / 2;
        if(a[mid] == x)
            j = mid;
        else if(x > a[mid]) {
            l = mid + 1;
        }
        else {
            h = mid - 1;
        }
    }
    return j;
}

int main() {
    int n;
    while(cin >> n) {
        for(int i = 0; i < n; i ++)
            cin >> a[i];
        sort(a, a + n);
        int x;
        cin >> x;
        cout << b_search(a, x, 0, n - 1) << endl;
    }
    return 0;
}