Recursive binary search

int binarySearch(int[] A, int low, int high, int x)
{
    if (low > high) {
        return -1;
    }
    int mid = (low + high) / 2;
    if (x == A[mid]) {
        return mid;
    }
    else if (x < A[mid]) {
        return binarySearch(A, low,  mid - 1, x);
    }
    else {
        return binarySearch(A, mid + 1,  high, x);
    }
}

Source: iq.opengenus.org

Similar codes

0 vote319 views1 answer
Set iterator
C++
0 vote325 views1 answer
Strong number in c++
C++
-1 vote295 views1 answer
Socket programming in cpp
C++
1 vote305 views2 answers
C++ cast to type of variable
C++
2 votes387 views1 answer
String to wstring
C++
18 votes331 views5 answers
C++ random number
C++
-2 votes316 views1 answer
Double pointers C++
C++
0 vote319 views1 answer
Print queue c++
C++
0 vote329 views1 answer
Binary multiplication
C++
2 votes350 views1 answer
Ph vid
C++