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

18 votes334 views5 answers
C++ clear console
C++
0 vote322 views2 answers
Greatest and smallest in 3 numbers cpp
C++
2 votes329 views3 answers
C++ lambda
C++
1 vote328 views1 answer
C++ vector move element to front
C++
0 vote351 views1 answer
Error: Microsoft Visual C++ 14.0 or greater is required. Get it with "Microsoft C++ Build Tools":
C++
24 votes319 views5 answers
Install heroku
C++
23 votes311 views2 answers
C++ user input
C++
4 votes366 views1 answer
Continue c++
C++
-1 vote339 views1 answer
I'm still here lyrics
C++
0 vote309 views1 answer
Error uploading arduino code
C++