#include<iostream>
bool binarySearch(int vector[], int size, int elem)
{
	bool gasit = false;
	int first = 0;
	int last = size - 1;
	while (gasit == false && first <= last)
	{
		int middle = (first + last) / 2;
		if (vector[middle] == elem)
			gasit = true;
		else if (elem < vector[middle])
			last = middle - 1;
		else first = middle + 1;
	}
	return gasit;
}
int main()
{
	int vector[20];
	int dim=7;
	for (int i = 0; i < dim; i++)
		vector[i] = i;
	if (binarySearch(vector, sizeof(vector) / sizeof(int), 23) == true)
		std::cout << "Gasit";
	else std::cout << " Nu gasit!";
}