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

3 votes183 views2 answers
C++ code for quicksort
C++
0 vote174 views1 answer
Temporary file using MSFT API in cpp
C++
15 votes174 views10 answers
Hello world
C++
0 vote177 views1 answer
C++ linker input and output
C++
17 votes161 views1 answer
Input a string in c++
C++
0 vote199 views4 answers
Convert java to c++
C++
-1 vote183 views1 answer
How to write hello world c++
C++
0 vote167 views1 answer
Closing a ifstream file c++
C++
0 vote176 views1 answer
Summation of Natural Number Sequence with c and c++.
C++
-1 vote199 views1 answer
How to append two vectors in c++
C++