binary searching

//* wap a program of binary searching *//

#include
#include
int BinarySearch(int Array[], int Value)
{
int First,Last,Mid;
First=0;
Last=9;
while(First<=Last)
{
Mid=(First+Last)/2;
if(Value==Array[Mid])
return(Mid);
else
if(Value Last=Mid-1;
else
if(Value>Array[Mid])
First=Mid+1;
}
return(-1);
}
void main()
{
int Array[10]={19,32,131,223,287,363,372,373,447,452};
int a,Value,pos;
clrscr();
printf("\n\n Ur List : ");
for(a=0;a<10;a++)
printf(" %d",Array[a]);

printf("\n\n\n Which Value U want To Find : ");
scanf("%d",&Value);

pos=BinarySearch(Array,Value);

if(pos==-1)
printf("\n\n\n Value Does Not Exist");
else
printf("\n\n\n Value Found At Position %d",pos+1);

getch();
}