Sunday, 31 July 2016

Binary Search



#include<stdio.h>
void b_search(int* a,int n,int value)
{
int low=0,high=n-1,flag=0,mid;
while(low<=high)
{
mid=(low+high)/2;
if(a[mid]==value)
{
flag=1;
break;
}
else if(a[mid]>value)
{
high=mid-1;
}
else
{
low=mid+1;
}
}
if(flag==0)
{
printf("Value is not found\n");
}
else
{
printf("Value is found\n");
}

}
int main()
{
int value;
int a[]={1,2,3,4,5,6,7,8,9,20};
int n=(sizeof(a))/(sizeof(int));
printf("enter the value you want to find\n");
scanf("%d",&value);
b_search(a,n,value);
return 0;
}


0 comments:

Post a Comment