Program to implement binary search in C.

Here is the code..

//AIM: TO PERFORN BINARY SEARCH

#include<stdio.h>

#define m 10
void main()
{
int a[10],i,j,mid,p,n;

printf("enter the no of elements in an array\n");
scanf("%d",&p);
printf("Enter %d elements in sorted order\n",p);
for(i=0;i<p;i++)
scanf("%d",&a[i]);
printf("entered array is:\n");
for(i=0;i<p;i++)
printf("%d\t",a[i]);
printf("\nenter the element you want to search\n");
scanf("%d",&n);
i=0;
j=9;
while(i<=j)
{
mid = (i+j)/2;
if(n==a[mid])
{
j=100;
break;
}
else if(n<a[mid])
j=mid-1;
else
i=mid+1;
}
if(j==100)
printf("ELEMENT IS PRESENT AT %d POSITION\n",(mid+1));
else
printf("ELEMENT IS NOT PRESENT\n");

}

For turbo C users.

//AIM: TO PERFORN BINARY SEARCH

#include<stdio.h>
#include<conio.h>
#define m 10
void main()
{
int a[10],i,j,mid,p,n;
clrscr();
printf("enter the no of elements in an array\n");
scanf("%d",&p);
printf("Enter %d elements in sorted order\n",p);
for(i=0;i<p;i++)
scanf("%d",&a[i]);
printf("entered array is:\n");
for(i=0;i<p;i++)
printf("%d\t",a[i]);
printf("\nenter the element you want to search\n");
scanf("%d",&n);
i=0;
j=9;
while(i<=j)
{
mid = (i+j)/2;
if(n==a[mid])
{
j=100;
break;
}
else if(n<a[mid])
j=mid-1;
else
i=mid+1;
}
if(j==100)
printf("ELEMENT IS PRESENT AT %d POSITION\n",(mid+1));
else
printf("ELEMENT IS NOT PRESENT\n");
getch();
}