Binary Search Using Functions
Binary Search Using Functions
#include<stdio.h>
void binarysearch(int a[],int l,int u,int mid,int key);
void swap(int *x,int *y)
{
int temp=*x;
*x=*y;
*y=temp;
}
void bubblesort(int a[],int n)
{
int i,j;
for(i=n-1;i>0;i--)
{
for(j=0;j<i;j++)
{
if(a[j]>a[j+1])
{
swap(&a[j],&a[j+1]);
}
}
}
}
int main()
{
int a[60],i,n,l,u,mid,key;
}
void binarysearch(int a[],int l,int u,int mid,int key)
{
while(l<=u)
{
if(a[mid]<key)
{
l=mid+1;
}
else if(a[mid]==key)
{
printf("\n %d is available at index %d",key,mid);
break;
}
else
{
u=mid-1;
}
mid=(l+u)/2;
}
if(l>u)
{
printf("\n element is not found");
}
}