Binary search c++

int binarySearch(int arr[], int l, int r, int x)
{
    if (r >= l) {
        int mid = l + (r - l) / 2;
        if (arr[mid] == x)
            return mid;
        if (arr[mid] > x)
            return binarySearch(arr, l, mid - 1, x);
        return binarySearch(arr, mid + 1, r, x);
    }
    return -1;
}

Source: google.com

Similar codes

0 vote236 views1 answer
How to block the screen c++
C++
8 votes208 views3 answers
Print to console c++
C++
3 votes294 views3 answers
Largest Subarray with Zero Sum
C++
2 votes235 views1 answer
C++ time nanoseconds
C++
1 vote217 views1 answer
Isalpha c++
C++
44 votes259 views10 answers
Youtube
C++
0 vote178 views1 answer
Gtest assert not equal
C++
0 vote246 views1 answer
C++ sorting and keeping track of indexes
C++
2 votes225 views1 answer
Multiline comment in C++
C++
1 vote251 views1 answer
Priority queue ordered by second element
C++