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 vote179 views1 answer
Bit c++
C++
0 vote164 views1 answer
Modify file CPP
C++
0 vote174 views1 answer
Return the index where maximum element in a vector
C++
2 votes180 views3 answers
Digit sum c++
C++
18 votes192 views3 answers
Sort(arr arr+n) in c++
C++
0 vote171 views1 answer
How to put string in array c++
C++
0 vote181 views1 answer
Print duplicate characters from string in c++
C++
0 vote230 views1 answer
C++ basic snippet
C++
4 votes160 views2 answers
String count occurrences c++
C++
3 votes162 views1 answer
Function in struct c++
C++