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

1 vote238 views1 answer
Pass c++
C++
2 votes223 views1 answer
Cin.tie c++
C++
0 vote236 views1 answer
Leetcode fast io
C++
0 vote235 views1 answer
How to declare an enum variable c++
C++
0 vote236 views1 answer
C++ drop last element of list
C++
1 vote210 views1 answer
Ue4 ftext c++
C++
1 vote247 views1 answer
Cpp malloc
C++
0 vote215 views1 answer
Convert ascii char value to hexadecimal c++
C++
0 vote212 views1 answer
Compilling c++ and c by console
C++
0 vote249 views1 answer
ViewController import
C++