Binary search using pointer in c?

Answer 1

#include
#include
#include
void main()
{
int a[10]={1,2,3,10,11,13,16,21,46,73};
int mid,lower=0,upper=9,num,flag=1;
clrscr();
printf("enter the number to search");
scanf("%d",&num);
printf("\n the list of the data is");
printf("%-20s","\ndata);
for(num=0;num<=upper;num++)
printf("%3d",a[num]);
printf("%-20s","\nindexno");
for(num=0;num<=upper;num++)
printf("%3d",num);
for(mid=(lower+upper)/2;lower<=upper;mid=(lower+upper)/2)
{
if(a[mid]==num)
{
printf("the number is at position %d in array",mid);
flag=0;
break;
}
if(a[mid]>num)
upper=mid-1;
else
lower=mid+1;
}
if(flag)
printf("element is not present in the array");
getch();
}

Answer 2

#include<conio.h>

#include<stdio.h>

void main()

{

int n,a[100],i,j,k,t,*p,*beg,*last,*mid,elmnt;

char ch;

clrscr();

printf("Enter no of elements : ");

scanf("%d",&n);

printf("\nEnter the elmnts :\n");

for(i=0;i<n;i++)

scanf("%d",&a[i]);

p=a;

for(i=0;i<n;i++)

{

for(j=i+1;j<n;j++)

{

if(*(p+i)>*(p+j))

{

t=*(p+i);

*(p+i)=*(p+j);

*(p+j)=t;

}

}

}

do{clrscr();

printf("\nSorted Array is:\n");

for(i=0;i<n;i++)

printf("%d\n",a[i]);

beg=&a[0];

last=&a[n-1];

printf("\nEnter element to be searched for : ");

scanf("%d",&elmnt);

while(*mid!=elmnt&&beg<=last)

{mid=beg+(last-beg)/2;

if(*mid<elmnt)

beg=mid+1;

if(*mid>elmnt)

last=mid-1;

}

if(*mid==elmnt)

printf("\nElement %d found ",elmnt);

else printf("\nElement not found ");

printf("\n\nPress <y> to search for another element..");

ch=getch();

}while(ch=='y');

}

----------------------------------------------------------------------------

Mithu