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 vote267 views2 answers
Power in c++
C++
0 vote251 views1 answer
C++ Syntax
C++
0 vote279 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++
10 votes264 views3 answers
Integer to char c++
C++
1 vote270 views1 answer
Print linked list recursively c++
C++
0 vote275 views2 answers
Size of unordered_set
C++
1 vote315 views1 answer
Unique_ptr header file
C++
4 votes278 views1 answer
Arduino uno hello world
C++
2 votes263 views1 answer
C++ wait for user input
C++
0 vote256 views1 answer
Can you use rand to read in from an external file inc++
C++