二分查找

在排序的数组中查找一个数，不存在则返回-1。

int binarySearch(int a[], int num, int value)
{
    int low, mid, high;
    
    low = 0;
    high = num - 1;

    while(low <= high){
        mid = (low + high) / 2;
        if (value == a[mid])
            return mid;
        else if(value < a[mid])
            high = mid -1;
        else
            low = mid + 1;
    }

    return -1;
}