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 vote139 views1 answer
How to check private messages on reddit
C++
101 votes295 views6 answers
How to turn int into string c++
C++
0 vote139 views1 answer
Cmake g++ address sanitizer
C++
0 vote187 views5 answers
Return tuple or null
C++
2 votes105 views1 answer
Read int from file c++
C++
-1 vote167 views1 answer
Multi initialisation if statement c++
C++
0 vote142 views6 answers
Python converter to c
C++
0 vote137 views7 answers
C++ convert to c online
C++
0 vote137 views1 answer
Fill vector with zeros c++
C++
-1 vote141 views1 answer
C++ filesystem remove file
C++