编辑代码

#include <stdio.h>
int search(int searchKey,int arr[],int arr_len)
{
    int low=0;
    int high=arr_len-1;
    int keyPos=-1;

    while(low<=high)
    {
        int mid=low+(high-low)/2;
        if(searchKey==arr[mid])
        {
            keyPos=mid;
            break;
        }
        else if(searchKey<arr[mid])
        {
            low=mid+1;
        }
        else
        {
            high=mid-1;
        }
    }
    return keyPos;
}
int main () {
    int arr[]={85, 63, 52, 34, 25, 17, 6};
    int arr_len=sizeof(arr)/sizeof(arr[0]);
    int n=search(6,arr,arr_len);
    if(n!=-1)
    {
        printf("找到啦！要找的数在数组的第%d个位置",n+1);
    }
    else
    {
        printf("未找到");
    }
    return 0;
}