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

0 vote298 views1 answer
Qt asynchronous HTTP request
C++
0 vote302 views1 answer
Greater <pair<int,int>>
C++
23 votes287 views2 answers
What is c++ function
C++
1 vote324 views3 answers
For vector c++
C++
0 vote297 views1 answer
[3,2,4,-1,-4]
C++
0 vote285 views1 answer
Smooth Poti values on Arduino
C++
-1 vote313 views1 answer
How to define range of numbers inside a if condition in c++
C++
1 vote300 views1 answer
What is the meaning of life and everything in the universe
C++
0 vote287 views1 answer
Sideways triangle c++ xy plane
C++
0 vote311 views1 answer
Glm has no member value_ptr
C++