二分法查找

#include<stdio.h>
int binary_search(int a[],int k,int sz)
{
    int left = 0;
    int right =sz;

    while(left<=right)        //注意是  <= 
    {
        int mid = left+(right-left)/2;
        if(a[mid]==k)
        {
            return mid;
        }
        else if(k<a[mid])
        {
            right = mid-1;
        }
        else
        {
            left = mid+1;
        }
    }
    if(left>right)
    {
        return -1;
    }

}
int main()
{
    int arr[10]  = {1,2,3,4,5,6,7,8,9,10};
    int key = 0;
    scanf("%d",&key);
    int sz = sizeof(arr)/sizeof(arr[0])-1;  //这一步很关键  如果写在binary_search函数里面，sizeof（arr）便等于4,4/4=1 
    int ret = binary_search(arr,key,sz);
    if(-1==ret)
    {
        printf("找不到\n");
    }
    else
    {
        printf("找到了：%d\n",ret);
    }

    return 0;
}