在一个有序数组中查找具体的某个数字n

#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
/*在一个有序数组中查找具体的某个数字n。
编写int binsearch(int x, int v[], int n); 功能：在v[0]<=v[1]<=v[2]<= ….<=v[n-1]的数组中查找x. */
//二分查找法：找到key返回下标，找不到返回-1
int binsearch(int arr[], int len, int key)
{
int left = 0;
int right = len - 1;
while (left<=right )
{
int mid = (left+right) / 2;
if (arr[mid]>key) //14 7
{
right = mid - 1;
}
else if (arr[mid]<key) //14 28
{
left = mid + 1;
}
else
{
return mid;
}
}
return -1;
}
int main()
{
int arr[10] = {2,5,7,8,9,10,24,27,29,41};
int len = sizeof(arr) / sizeof(arr[0]);
int ret=binsearch(arr,len,10);
if (ret==-1)
{
printf(“not found!\n”);
}
else
{
printf("%d\n",ret);
}
return 0;
}