Wap to implement binary search

Wap to implement binary search

#include<stdio.h>

#include<conio.h>

int main()

{

clrscr();

int c, first,last,middle,n, search,array[100];

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)

printf("not found %d is not present in the list. \n",search);

return 0;

}