Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int bisection_search(vector <int> & arr, int left, int right, int key){
- int mid;
- while(left < right){
- mid = (left + right) / 2;
- if(key <= arr[mid]){
- right = mid;
- }
- else{
- left = mid + 1;
- }
- }
- if(arr[right] == key){
- return right;
- }
- return -1;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement