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

8 votes191 views1 answer
How to print every element of the array in cpp
C++
0 vote240 views1 answer
C++ triple
C++
0 vote210 views1 answer
Niet werkend
C++
6 votes225 views1 answer
Convert string to stream c++
C++
3 votes211 views5 answers
Euclid algorithm
C++
0 vote200 views1 answer
Freeing array in c++
C++
0 vote219 views1 answer
Unary overload operator cpp
C++
2 votes237 views4 answers
Bubble Sort
C++
1 vote228 views1 answer
Call by value in c++
C++
2 votes227 views1 answer
What is -> in c++
C++