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 votes261 views4 answers
Or in cpp
C++
0 vote250 views1 answer
C++ delete printed characters
C++
1 vote284 views1 answer
C++ 2d vector assign value
C++
2 votes248 views1 answer
How to use string variable in switch case in c++
C++
0 vote253 views1 answer
PascalName seperate strings
C++
30 votes267 views5 answers
Remove value from vector c++
C++
0 vote268 views1 answer
Ds1307 rtc set time
C++
0 vote265 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 vote253 views1 answer
What does map.count() return in c++
C++
4 votes253 views2 answers
Sqrt cpp
C++