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

99 votes257 views6 answers
How to convert int to string c++
C++
0 vote125 views1 answer
Find with hash set
C++
0 vote120 views1 answer
Int a=0; int b=30;
C++
0 vote149 views1 answer
Stoi() c++
C++
3 votes137 views1 answer
What language was c+ written in
C++
0 vote125 views1 answer
Bounded and unbounded solution in lpp
C++
56 votes147 views6 answers
List conda environments
C++
0 vote154 views1 answer
Vs_buildtools.exe --norestart --passive --downloadThenInstall --includeRecommended --add Microsoft.VisualStudio.Workload.NativeDesktop --add Microsoft.VisualStudio.Workload.VCTools --add Microsoft.VisualStudio.Workload.MSBuildTools
C++
0 vote111 views1 answer
C++ hours minutes seconds
C++
5 votes117 views2 answers
String c++ if letter is lowercase
C++