Skip to main content

PROGRAM TO PERFORM BINARY SEARCH USING RECURSION


LIST OF PROGRAMS



#include<stdio.h>
#include<conio.h>
int binary(int ,int );
int a[10],md,s,c=0;
void main()
{
int n,i;
clrscr();
printf("ENTER LIMIT \n");
scanf("%d",&n);
printf("ENTER ARRAY\n");
for(i=0;i<n;i++)
{
fflush(stdin);
scanf("%d",&a[i]);
}
printf("ENTER NUMBER TO BE SEARCHED");
scanf("%d",&s);
c=binary(0,n-1);
if(c==-1)
printf("NOT FOUND");

getch();
}
int binary(int f,int l)
{
 md=(f+l)/2;
if(f>l)
{ return(-1);
}
else if (a[md]<s)
return(binary(md+1,l));
else if(a[md]==s)
{printf("Found AT LOCATION %d IN WHICH 0 IS THE STARTING ADDRESS",md);
return (1);
}
else
return(binary(f,md-1));
}

Comments

anuj batham said…
This comment has been removed by the author.
Anonymous said…
gud program it saved my grade during practicals

Popular posts from this blog

unix commands