#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;
}