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 vote257 views1 answer
C++ how to check whether a file exists?
C++
0 vote267 views1 answer
Find maximum contiguous Sub arrays
C++
4 votes270 views2 answers
C++ inline if
C++
0 vote240 views1 answer
Person parametr cpp
C++
0 vote267 views1 answer
Print reverse number
C++
0 vote262 views1 answer
InstallUtil.exe ConsoleApp
C++
0 vote248 views1 answer
130 divided by -10
C++
1 vote234 views1 answer
Random number between x and y c++
C++
1 vote255 views1 answer
Como medir tiempo de ejecucion cpp
C++
0 vote264 views1 answer
QT form doesn't take changes
C++