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

4 votes179 views2 answers
Round double to n decimal places c++
C++
0 vote188 views1 answer
C++ load file as vector
C++
1 vote180 views1 answer
Arguments to a class instance c++
C++
1 vote192 views1 answer
C++ remove text file
C++
6 votes162 views4 answers
String to upper c++
C++
0 vote169 views1 answer
Post order from preorder and inorder calculator
C++
0 vote156 views1 answer
Sleep system function linux c++
C++
2 votes191 views3 answers
Online ide c++
C++
11 votes168 views2 answers
C++ int main()
C++
0 vote154 views1 answer
Read a whole line from the input
C++