二分法在数组中查找某个数字的下标

#include<stdio.h>
int main()
{
	//用二分法在某一数组中寻找某一个数
    int arr[]={1,2,3,4,5,6,7,8,9,10};
    int k=1;
    int s=sizeof(arr)/sizeof(arr[0]);
    int left=0;
    int right=s-1;
    scanf("%d",&k);
	while(left<=right){
    int mid=(left+right)/2;
       if(arr[mid]>k)
	   {
           right=mid-1;
	   }
	   else if(arr[mid]<k)
	   {
		   left=mid+1;
	   }
	   else
	   {
	   printf("该元素下标是：%d\n",mid);
	   break;
	   }
	   if(left>right)
	   {
	   printf("找不到");
	   }
	}
	return 0;
}