For Binary search:

#include<stdio.h>
#include<conio.h>
void main()
{
int n,i,flag=0,lb=0,ub=8,a[9],mid=0;
clrscr();
printf("Enter 9 numbers\n");
for(i=0;i<9;i++)
{
scanf("%d",&a[i]);
}
printf("Enter the number to be searched\n");
scanf("%d",&n);
mid=(lb+ub)/2;
while(lb<=ub)
{
if(a[mid]==n)
{
flag=1;
break;
}
else if(n>a[mid])
lb=mid+1;
else
ub=mid-1;
mid=(lb+ub)/2;
}
if(flag==0)
printf("%d is not present\n",n);
if(flag==1)
printf("%d is present at %d location\n",n,mid+1);
getch();
}