Binary Search- program

#include<stdio.h>
#include<conio.h>
voidmain()
{
int a[50],i,j,n,k,min,max,mid,s=0;
clrscr();
printf("enter the range");
scanf("%d", &n);
printf("enter the values")
for(i=1;i<=n;i++)
{
scanf("%d",7a[i]);
}
printf("enter key");
scanf("%d",&k);
for(i=1;i<=n;i++)
{
for(j=1;j<=n-i;j++)
{
if(a[j]>a[j+1])
{
t=a[j];
a[j]=a[j+1];
a[j=1]= t;
]
while(min<=max)
{
mid= min=max/2;
if(a[mid]==k)
{
printf("key found");
s=1;
break;
}
else
if(a[mid]>=k)
max=mid-1;
else
if(a[mid]>=k)
min=mid+1;
}
}
if(s==0)
]
printf("not");
}
getch();
}