C语言：二分法查找

#include<stdio.h>
main()
{
int a[10]={23,24,25,26,27,28,38,39,40,45};
int k;
int top,bot,mid;
scanf("%d",&k);
top=0;
bot=9;
mid=(top+bot)/2;
while(bot>top)
{
if(k==a[mid])
{
printf("这个数位置在：%d",mid);
break;
}
else
{
if(k>a[mid])
{
top=mid+1;
mid=(top+bot)/2;
}
else
{
bot=mid-1;
mid=(bot+bot)/2;
}
}
}
if(bot<=top)
printf("没有发现");
}