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 vote127 views1 answer
Sort deque in c++
C++
0 vote179 views1 answer
Ue4 c++ string from fvector
C++
6 votes148 views2 answers
Index string c++
C++
3 votes166 views1 answer
Findung the mode in c++
C++
2 votes157 views1 answer
Allocation an array with new cpp
C++
1 vote218 views1 answer
How to substract to give a positive outcome in c++
C++
0 vote173 views1 answer
++ how to write quotation mark in a string
C++
0 vote173 views1 answer
Minimumm sort tryed
C++
1 vote167 views1 answer
Cout char32_t c++
C++
0 vote169 views1 answer
C++ sort cout end
C++