c语言二分查找

#include<stdio.h>
int binary₋search(int a[],int k,int s)
{
    int left=0;
    int right=s-1;
    int mid;
    while(left<=right)
    {   mid=(left+right)/2;
        if(a[mid]<k)
        {
            left=mid+1;
        }
        else if(a[mid]>k)
        {
            right=mid-1;
        }
        else
        {   return mid;
            break;
        }

    }
    return -1;
}
int main()
{
    int arr[]= {212,304,529,601,817};
    int sz=sizeof(arr)/sizeof(arr[0]);
    int k=0;
    scanf("%d",&k);
    int ret=binary₋search(arr,k,sz);
    if(ret>=0)
        printf("%d is at a[%d]",k,ret);
    else if(ret<0)
        printf("找不到");
}