BinarySearch

BinarySearch.c

int search(int array[], int n, int value) {
    int left = 0;
    int right = n - 1;
    while (left <= right) {
        int mid = left + ((right - left) >> 1);
        if (array[mid] > value) {
            right = mid - 1;
        } else if (array[mid] < value) {
            left = mid + 1;
        } else {
            return mid;
        }
    }
    return -1;
}