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

9 votes97 views5 answers
Priority queue c++ min heap
C++
0 vote128 views1 answer
C++ code 2d block
C++
12 votes125 views3 answers
C++ vector size
C++
0 vote130 views1 answer
C++ execution time
C++
0 vote143 views1 answer
Cpp language explained
C++
0 vote141 views1 answer
Scan line in c++
C++
0 vote120 views1 answer
How to increase array memory in c++
C++
0 vote137 views1 answer
Error: use of parameter outside function body before ] token c++
C++
0 vote126 views1 answer
What is xor_eq c++
C++
3 votes117 views3 answers
C vs c++ vs c#
C++