Write a Program to implement Binary search in
array.
#include<stdio.h>
#include<conio.h>
void main()
{
int
i, first, last, middle, n, search, array[100];
printf("Enter
number of elements\n");
scanf("%d",&n);
printf("Enter
%d integers(in ascending orders)\n", n);
for
(i=0;i<n;i++)
scanf("%d",&array[i]);
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("%d
found at location %d.\n", search, middle+1);
break;
}
else
last=middle
- 1;
middle=(first
+ last)/2;
}
if(first>last)
printf("Not
found!\n");
}
OUTPUT:
Enter the number of
elements in array
4
Enter 4 integer (in
ascending orders)
74
75
95
99
Enter value to
search
95
95 found at location
3
