Google Search

Saturday, January 28, 2012

ALGORITHM AND C PROGRAM TO SEARCH AN ELEMENT USING BINARY SEARCH


ALGORITHM TO SEARCH AN ELEMENT USING BINARY SEARCH 
1.  low = 1,high = n
2.  Repeat step 3 to 5 while low <= high
3.  mid = (low + high)
4.  If a[mid] = x
       Print “ found at mid”
       Return
5.  If (a[mid] < x)
        low = mid + 1
     Else
        High = mid – 1
6.  Print “x not found”
7.  Exit


//binary search
#include<stdio.h>
#include<conio.h>
void main()
{
int a[100],i,loc,mid,beg,end,n,flag=0,item;
clrscr();
printf("How many elements");
scanf("%d",&n);
printf("Enter the element of the array\n");
for(i=0;i<=n-1;i++)
{
scanf("%d",&a[i]);
}
printf("Enter the element to be searching\n");
scanf("%d",&item);
loc=0;
beg=0;
end=n-1;
while((beg<=end)&&(item!=a[mid]))
{
     mid=((beg+end)/2);
       if(item==a[mid])
  {
     printf("search is successfull\n");
     loc=mid;
     printf("position of the item%d\n",loc+1);
     flag=flag+1;
  }
      if(item<a[mid])
 end=mid-1;
 else
 beg=mid+1;
}
if(flag==0)
{
printf("search is not successfull\n");
}
getch();

0 comments:

Post a Comment