Binary search return index c++

int binarySearch(vector<int>& arr, int p, int r, int num) {
        while (p <= r) {
            int mid = (p + r)/2;
            
            if (arr[mid] == num) return mid;
            else if (arr[mid] > num) r = mid-1;
            else  p = mid+1;
        }
        return -1;
    }

Similar codes

3 votes114 views2 answers
Fast Inverse Square Root
C++
0 vote142 views1 answer
Bfs sudocode
C++
0 vote117 views1 answer
C++ how to do a pointer char to take varols from keyboard
C++
0 vote106 views1 answer
Vector keyword in c++
C++
0 vote104 views1 answer
C++ sum a vector of digits
C++
8 votes122 views1 answer
Remove last letter in string c++
C++
1 vote113 views1 answer
Rapidjson write stringbuffer to file
C++
7 votes147 views2 answers
Qt int to string
C++
0 vote118 views1 answer
_ZNSolsEi
C++
0 vote118 views1 answer
C++ excel cell blank cells
C++