Binary Search

 #include<stdio.h>

#include<conio.h>

void main()

{

int array[99], i, first, last, middle, n, search;

clrscr();

printf("Enter number of elements\n");

scanf("%d",&n);

printf("Enter Elements into the Array\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("%d is not found in the list.\n", search);

}

getch();

}