This is program for Binary Search in 1-D Array.
#include<stdio.h>
int main()
{
int k, a[10], n, i, high, low, mid;
printf("enter the no of elements you want to add : ");
scanf("%d",&n);
printf("enter the array elements : ");
for(i=0; i<n; i++)
{
scanf("%d",&a[i]);
}
printf("enter the element you want to search : ");
scanf("%d",&k);
low = 0;
high = n-1;
while(low<=high)
{
mid = (low+high)/2;
if(k<a[mid])
{
high=mid-1;
}
else if(k>a[mid])
{
low=mid+1;
}
else if(k==a[mid])
{
printf(" element found at %d location.",mid+1);
break;
}
}
if(low>high){
printf("element not found.");
}
}
0 Comments