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 vote96 views1 answer
Max pooling in c++
C++
0 vote98 views1 answer
Binary add using strings
C++
3 votes51 views1 answer
(a) one-dimensional arrays and multidimensional arrays in c++
C++
1 vote99 views3 answers
Comment in c++
C++
4 votes105 views3 answers
Converting char to int in c++
C++
1 vote109 views1 answer
Chess perft 5
C++
0 vote116 views1 answer
String to decimal c++ strtol
C++
1 vote97 views1 answer
What is time complexity of min_element()
C++
0 vote102 views1 answer
Convert characters to lowercase c++
C++
19 votes101 views1 answer
How to load from files C++
C++