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 vote189 views1 answer
Temperature conversion in c++
C++
0 vote164 views1 answer
Int a=0; int b=30;
C++
0 vote170 views1 answer
Insert only unique values into vector
C++
1 vote148 views1 answer
C++ find in pair
C++
2 votes179 views1 answer
C++ lambda thread example
C++
0 vote171 views1 answer
Srand() c++
C++
24 votes165 views5 answers
Install heroku
C++
0 vote154 views1 answer
Std::map get all keys
C++
10 votes184 views3 answers
C++ check if file exits
C++
7 votes124 views1 answer
C++ create class from class name
C++