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 vote175 views1 answer
\frac{2}{5}MR^2 typed in c++
C++
0 vote185 views1 answer
Sum of first 100 natural numbers
C++
0 vote212 views1 answer
Shift element to end of vector c++
C++
3 votes174 views4 answers
Typedef
C++
0 vote195 views1 answer
Stream Overloading
C++
0 vote236 views1 answer
How to print a text in c++
C++
0 vote139 views1 answer
Footnote appears in the middle latex
C++
0 vote189 views1 answer
Delete heap array c
C++
0 vote180 views1 answer
Call to constructor of 'extClockType' is ambiguous extClockType time2;
C++
1 vote176 views2 answers
Cpp compare strings
C++