BINARY SEARCH
#include<conio.h>
#include<stdio.h>
main()
{
int
a[100],l,n,h,s,j,mid,i,temp;
printf("enter
you want total number:");
scanf("%d",&n);
for(i=0;i<n;i++)
{
printf("enter
no:");
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(a[i]>a[j])
{
temp=a[j];
a[j]=a[i];
a[i]=temp;
}
}
}
for(i=0;i<n;i++)
{
printf("%d\n",a[i]);
}
printf("enter
search no");
scanf("%d",&s);
l=0;
h=n-1;
for(i=0;i<n;i++)
{
mid=(l+h)/2;
if(a[mid]<s)
{
l=mid+1;
}
else
if(a[mid]>s)
{
h=mid-1;
}
else
if(a[mid]==s)
{
printf("a[%d]",mid+1);
break;
}
}
if(a[mid]!=s)
{
printf("error");
}
getch();
}
OUTPUT
No comments:
Post a Comment