# Binary search: C Program

0
72

In computer science, a binary search or half-interval searchÂ algorithmÂ finds the position of a specified input value (the search “key”) within an array sorted by key value.For binary search, the array should be arranged in ascending or descending order. In each step, the algorithm compares the search key value with the key value of the middle element of the array. If the keys match, then a matching element has been found and its index, or position, is returned. Otherwise, if the search key is less than the middle element’s key, then the algorithm repeats its action on the sub-array to the left of the middle element or, if the search key is greater, on the sub-array to the right. If the remaining array to be searched is empty, then the key cannot be found in the array and a special “not found” indication is returned.

A binary search halves the number of items to check with each iteration, so locating an item (or determining its absence) takes logarithmic time. A binary search is a dichotomicÂ divide and conquer search algorithm.

```1Program2Outputâ€¹â€º
[message_box title="Program" color="blue"]

#include <stdio.h>
#include <conio.h>
Â
void main()
{
int c, first, last, middle, n, search, array[100];
Â   clrscr();

printf ("Enter number of elements\n");
scanf ("%d",&n);
Â
printf ("Enter %d integers\n", n);
Â
for ( c = 0 ; c < n ; c++ )
scanf("%d",&array[c]);
Â
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 )
Â
getch();
}
[/message_box]
1Program2Outputâ€¹â€º```
SHARE
Previous articleBubble Sort: C Program
I am third year student of computer engineering in L.D COLLEGE OF ENGINEERING,Ahmedabad.