#include<stdio.h>
#include<conio.h>
int array[10];
int tmp;
int *tmp2;
int temp;
int * count;
int * exist;
void GetData(int a[]);
void Sort(int a[]);
void Print(int a[]);
void find_binary(int a[],int x,int * start ,int * end);
int main()
{
	int input,st,en,cn,ex;
	clrscr();
	GetData(array);
	Sort(array);
	ex=0;
	cn=0;
	printf("\n\t\t\t Enter The search key:");
	scanf("%d",&input);
	*tmp2=10;
	en=10;
	st=1;
	find_binary(array,input,&st,&en);
	Print(array);
	if (exist==0)
	{
		printf("\n\t\t\t Find Not found!");
	}
	else
	{
		printf("\n\t\t\t Find succesfull!");
		printf("\n\t\t\t Count of search: %d!",cn);
	}
	getchar();
	getchar();
	return 0;
}

void GetData(int a[])
{
	int c;
	printf("\n\t\t*_*_*_*_* This program sortting integer number *_*_*_*_*\n");
	for(c=0;c<10;c++)
	{
		printf("\n Enter Number %d =>",c+1);
		scanf("%d",&a[c]);
	}

}
void Sort(int a[])
{
	int c,temp,n;
	for(c=0;c<10;c++)
	{
		for( n=c+1;n<10;n++)
		{
			if (a[c]>a[n])
			{
				temp=a[c];
				a[c]=a[n];
				a[n]=temp;
			}
		}
	}
}
void Print(int a[])
{
	int c;
	printf("\n___________________________f_____________________________________________________\n");
	printf("\n\t\t*_*_*_*_* This program sortting integer number *_*_*_*_*\n");
	for( c=0;c<10;c++)
		printf("\n  \t\t\t%d  =>%d",c+1,a[c]);
}
void find_binary(int a[],int x,int * start ,int * end)
{
       (*count)++;
       tmp=((*end)+(*start))/2;
       while (((*start)<(*end))&&((*start)!=(*end)))
       {
	       if (a[tmp]==(x))
	       {
		       (*start)=(*end);
		       (*exist)=1;
	       }
	       if (a[tmp]<x)
	       {
		   temp=tmp;
		   find_binary(a,x,&temp,end);
	       }
	       if (a[tmp]>x)
	       {
		   temp=tmp;
		   find_binary(a,x,start,&temp);
	       }
       }
}