二分法找数组中某个元素

#include<stdio.h>
int main()
{
int arr[]={1,2,3,4,5,6,7,8,9,0};
int i=0;
scanf("%d",&i);
int left=0;
int right=sizeof(arr)/sizeof(arr[0])-1;
mid=left+(right-left)/2;
while(left<=right)
{
if (arr[mid]<i)
{left=mid+1;}
else if (arr[mid]>i)
{ left=mid-1;}
else
{break;}

}
if(left<=right)
printf(“yes”);
else
printf(“no”);
return 0;
}