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

1 vote277 views2 answers
Read comma separated text file in c++
C++
1 vote238 views1 answer
Shared_ptr header file
C++
0 vote252 views1 answer
Static_cast c++
C++
0 vote230 views1 answer
Check whether the jth object is in the subset
C++
0 vote240 views1 answer
What does sultion mean in a particle model
C++
10 votes246 views2 answers
Difference between programming and coding
C++
0 vote242 views1 answer
Windows servis from console app
C++
0 vote269 views1 answer
How to create a c++ templeate
C++
19 votes237 views1 answer
Access last element in vector in c++
C++
0 vote241 views1 answer
Input n space separated integers in c++
C++