Friday, November 27, 2009

30WAP TO SEARCH A N ELEMENT IN AN ARRAY USING BINARY SEARCH

//WAP TO SEARCH A N ELEMENT IN AN ARRAY USING BINARY SEARCH
#include
#include
void main()
{
int a[20],i,n,mid,x,item;
int beg,end,loc=-1;
clrscr();
printf("\n\nENTER THE NO OF ELEMENTS=");
scanf("%d",&n);
printf("\n\nENTER THE SORTED NUMBERS");
printf("\n\nENTER THE VALUES=\n\n");
for(i=0;i < n ; i++)
scanf("%d",&a[i]);
printf("\n\nENTER THE VALUE TO BE SEARCHED=");
scanf("%d",&item);
beg=0;
end=n-1;
while(beg<=end)
{
mid=(beg+end)/2;
if(a[mid]==item)
{
loc=mid;
printf("\n\nNUMBER IS AT %d LOCATION",loc+1);
break;
}
else
if(a[mid]>item)
end=end-1;
else
beg=mid+1;
}
if(loc==-1)
printf("\n\nITEM IS NOT PRESENT");
getch();
}
/**********************************************************************
OUTPUT
***********************************************************************


ENTER THE NO OF ELEMENTS=5


ENTER THE SORTED NUMBERS

ENTER THE VALUES=

1
2
3
4
5


ENTER THE VALUE TO BE SEARCHED=3


NUMBER IS AT 3 LOCATION

*/

No comments:

Post a Comment

Programming the Whole World!