WAP FOR SEARCHING ELEMENT FROM 10 ELEMENTS BY THE BINARY SEARCH

Thursday, July 2, 2009 Leave a Comment

#include<stdio.h>
#include<conio.h>
void main()
{
int arr[10]={1, 2, 3, 9, 11, 13, 17, 25, 57, 90};
int mid,lower=0,upper=9,num,flag=1;
clrscr();
printf("enter a number to search:");
scanf("%d",&num);
for (mid=(lower+upper)/2;lower<=upper;
mid=(lower+upper)/2)
{
if (arr[mid]==num)
{
printf("the number is at position %d in the array.",
mid);
flag=0;
break;
}
if (arr[mid]>num)
upper=mid-1;
else
lower=mid+1;
}
if(flag)
printf ("Element is not present in the array.");
getch();
}

                                   OUTPUT

Enter a number to search:25
The number is at position 7 in the array.

Related Posts :



0 comments »

Leave your response!