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 vote150 views1 answer
Find first of a grammar
C++
3 votes122 views1 answer
Initialzing a 2d vector in cpp
C++
3 votes137 views1 answer
Initialize dynamic array c++ to 0
C++
11 votes135 views3 answers
Count occurrences of character in string c++
C++
0 vote87 views1 answer
C++ code executio canntot proceed because glew32.dll was not founud
C++
1 vote311 views1 answer
How to iterater map of sets in c++
C++
2 votes131 views5 answers
C++ loop through array
C++
2 votes144 views2 answers
Editable div
C++
4 votes123 views1 answer
Log base e synthax c++
C++
0 vote124 views1 answer
Run c++ files on chrome book
C++