BINARY SEARCH

EXAMPLE-:-------(Program to implement binary search)

#include
#include

void main()
{
int num[20],ord[20],n,i,j,p,s,temp;
int ul,ll,mid;
clrscr();
printf("enter the limit-->");
scanf("%d",&n);
printf("Enter the DATA-->\n");
for(i=0;i<n;i++)
{
scanf("%d",&num[i]);
ord[i]=num[i];
}
for(i=0;i<n-1;i++)
{
for(j=i+1;jord[j])
{
temp=ord[i];
ord[i]=ord[j];
ord[j]=temp;
}
}
}
clrscr();
printf("\n<--THE SORTED LILST-->");
for(i=0;i<n;i++)
printf("\n%d",ord[i]);

printf("\n\nEnter the search element--->");
scanf("%d",&s);
ll=0;
ul=n;
while(1)
{
mid=(ll+ul)/2;
if((ul==llul<0)&&ord[mid]!=s)>s)
ul=mid-1;
else if(ord[mid]==s)
{
printf("\nExists\n\n");
printf("\nPosition-->%d",mid+1);
break;
}
else if(ord[mid]<s)
ll=mid+1;
}
getch();
}