#include <bits/stdc++.h>
using namespace std;
bool binarySearch(vector<int> v, int key, int start, int end) {
cout<< start<< " "<< end <<endl;
if(start > end) {
return false;
}
int temp_start = start, temp_end = end;
int mid = (start + end)/2;
if(v[mid] == key) {
return true;
}
if(v[mid] > key) {
end = mid - 1;
}
else {
start = mid + 1;
}
bool ans = binarySearch(v, key, start, end);
cout<< temp_start<< ", "<< temp_end << " returned " << ans << endl;
return ans;
}
int main() {
vector<int> v = {1,2,3,4,5,6,7};
cout<< binarySearch(v, -1, 0, v.size()-1);
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgpib29sIGJpbmFyeVNlYXJjaCh2ZWN0b3I8aW50PiB2LCBpbnQga2V5LCBpbnQgc3RhcnQsIGludCBlbmQpIHsKCWNvdXQ8PCBzdGFydDw8ICIgIjw8IGVuZCA8PGVuZGw7CglpZihzdGFydCA+IGVuZCkgewoJCXJldHVybiBmYWxzZTsKCX0KCWludCB0ZW1wX3N0YXJ0ID0gc3RhcnQsIHRlbXBfZW5kID0gZW5kOwoJaW50IG1pZCA9IChzdGFydCArIGVuZCkvMjsKCWlmKHZbbWlkXSA9PSBrZXkpIHsKCQlyZXR1cm4gdHJ1ZTsKCX0KCWlmKHZbbWlkXSA+IGtleSkgewoJCWVuZCA9IG1pZCAtIDE7Cgl9CgllbHNlIHsKCQlzdGFydCA9IG1pZCArIDE7Cgl9Cglib29sIGFucyA9IGJpbmFyeVNlYXJjaCh2LCBrZXksIHN0YXJ0LCBlbmQpOwoJY291dDw8IHRlbXBfc3RhcnQ8PCAiLCAiPDwgdGVtcF9lbmQgPDwgIiByZXR1cm5lZCAiIDw8IGFucyA8PCBlbmRsOwoJcmV0dXJuIGFuczsKfQoKaW50IG1haW4oKSB7Cgl2ZWN0b3I8aW50PiB2ID0gezEsMiwzLDQsNSw2LDd9OwoJY291dDw8IGJpbmFyeVNlYXJjaCh2LCAtMSwgMCwgdi5zaXplKCktMSk7CglyZXR1cm4gMDsKfQ==