C＋＋二分查找代码

//C＋＋二分查找代码
#include<iostream>
using namespace std;

int search(int array[], int n, int v)
{
    int left, right, middle;
    left = 0, right = n - 1;

    while (left <= right) {
        middle = (left + right) / 2;
        if (array[middle] > v) right = middle - 1;
        else if (array[middle] < v) left = middle + 1;
        else return middle;
    }
    return -1;
}


int main()
{
    int array[10] = {1, 2, 3, 6, 7, 7, 8, 9, 13, 19};
    cout << search(array, 10, 19) << endl;
    return 0;
}

http://www.cppblog.com/converse/archive/2009/10/05/97905.html