#include<stdio.h>
#include<windows.h>


int binarySearch(int* m,int key,int left,int right)
{
	int middle = (left + right) / 2;

	if(left > right) return 0;

	if(key > m[middle])	return binarySearch(m,key,middle + 1,right);
	else if(key < m[middle]) return binarySearch(m,key,left,middle - 1);
	else return 1;
}

int main()
{
	int m[] = {1,2,3,4,5,6,7,8,9,12};


	int a = 0;
	int i = 0;
	for(;i<10;i++)
	{
		printf("%d ",m[i]);
	}
	printf("\n");

	while(true)
	{
		    printf("\n\nfound element : ");
			scanf("%i",&a);
			if(binarySearch(m,a,0,9)) printf("Element was found");
			else printf("Element was not found");
	}
	//printf("%d",a);



	return 0;
}