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 vote321 views1 answer
C++ default constructor remove
C++
5 votes319 views1 answer
Cpp all in one header
C++
2 votes336 views2 answers
Char
C++
0 vote353 views1 answer
C++ write number to registry
C++
1 vote326 views1 answer
Collections c# vs c++
C++
1 vote335 views1 answer
How to traverse a linked list in c++
C++
35 votes367 views3 answers
How to write hello world in c++
C++
1 vote301 views1 answer
Arduino funktion
C++
0 vote319 views1 answer
Hello world in c/++
C++
12 votes288 views3 answers
Continue c++
C++