Binary Search Algorithm
Q. Explain binary search?
ANS.: Search elements in sorted array efficiently by using first, mid and last .
Programming for Binary Search Algorithm.
Source Code.
#include<stdio.h>
#include<conio.h>
int main()
{
int c,first,last,middle,n,search,array[100];
printf("Enter no:");
scanf("%d",&n);
printf("Enter %d interger\n",n);
for(int i=0;i<n;i++)
{
scanf("%d",&array[n]);
}
printf("enter value to find \n");
scanf("%d",&search);
first=0;
last=n-1;
middle=(first+last)/2;
while(first<=last)
{
if(array[middle]<search)
first=middle+1;
else if(array[middle]=search)
{
printf("\n %d found at location %d \n",search,middle+1);
break;
}
else
last=middle-1;
middle=(first+last)/2;
}
if(first>last)
printf("\n Not found %d isnot present in the list \n",search);
return 0;
}Output.
Enter no:5
Enter 5 interger
1
2
3
4
5
enter value to find
3
3 found at location 3
