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

3 votes117 views3 answers
Quick sort c++
C++
0 vote101 views1 answer
"how we write a program for" time swap" in c plus plus only with string"
C++
0 vote115 views1 answer
Has substr c++
C++
0 vote109 views1 answer
C++ meaning ::
C++
5 votes105 views1 answer
How to disable buttons in unity
C++
0 vote94 views1 answer
Public method
C++
1 vote95 views1 answer
C++ print vector without loop
C++
1 vote99 views1 answer
Go read file to string
C++
0 vote98 views1 answer
Dfs program in c++
C++
0 vote90 views1 answer
How to increase array memory in c++
C++