/*
	Binary Search
    Made By  Gaurang Sinha
     gaurang85.tripod.com
*/

#include<stdio.h>
#include<conio.h>

int i,j,n,a[20],t,high,low,mid,key,ans=0;
void ssort();
int main()
{
clrscr();
printf("Enter the no of elements : ");
scanf("%d",&n);
for(i=0;i<n;i++)
{
	printf("\nElement %d:\t",i+1);
	scanf("%d",&a[i]);
}
ssort();
for(i=0;i<n;i++)
	printf("\nElement %d : %d",i+1,a[i]);
printf("\nEnter the element to be found : ");
scanf("%d",&key);
low=0;
high=n-1;
while(high>=low)
{
mid=(high+low)/2;
if(a[mid]==key)
{
	printf("\nThe element is found at %d",mid+1);
	ans=1;
	break;
}
if(a[mid]>key)
	high=mid-1;
if(a[mid]<key)
	low=mid+1;
}
if(ans!=1)
	printf("\nNo match found");
getch();
return 0;
}

void ssort()
{
for(i=0;i<n;i++)
{
	for(j=i+1;j<n;j++)
	{
		if(a[i]>a[j])
		{
			t=a[i];
			a[i]=a[j];
			a[j]=t;
		 }
	}
}
}