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

6 votes169 views1 answer
To_string c++
C++
35 votes248 views2 answers
How to remove middle element in vector c++
C++
0 vote189 views1 answer
Z transfrom mathlab
C++
0 vote174 views1 answer
Deal with bad input cpp
C++
0 vote162 views1 answer
C++ convert integer to digits, as vector
C++
0 vote164 views1 answer
Convert GLFWwindow* to IntPtr
C++
84 votes318 views4 answers
Php string
C++
0 vote168 views1 answer
How to store pair in min heap in c++
C++
0 vote180 views1 answer
How to find size of int array in c++
C++
8 votes182 views3 answers
Stack implementation using class in c++
C++