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 vote247 views1 answer
Codeforces Pangram in c++
C++
3 votes196 views1 answer
C++ how to make a negative float positive
C++
0 vote195 views1 answer
Inverse Square
C++
19 votes203 views1 answer
C++ files
C++
0 vote196 views2 answers
The code execution cannot proceed because glew32.dll was not found
C++
1 vote216 views1 answer
Ue4 spawn actor c++
C++
2 votes189 views2 answers
String split by space c++
C++
0 vote138 views1 answer
How to print hex of char c++
C++
0 vote196 views1 answer
All permutations with repetition C++
C++
148 votes561 views10 answers
Grepper
C++