#include <stdio.h>
int binary_search(int arr[], int key, int sz)//注意这里不能有:不然会报错
{
int left = 0;
int right = sz - 1;
while(left <= right)
{
int mid = left + (right - left)/2;
if(arr[mid] == key)
{
return mid;
}
if(arr[mid] > key)
{
right = mid - 1;
}
else
{
left = mid + 1;
}
}
return -1;
}
int main()
{
int arr [10] = {1,2,3,4,5,6,7,8,9,10};
int key = 6;
int sz = sizeof(arr)/sizeof(arr[0]);
int ret = binary_search(arr,key,sz);
if (ret == -1)
{
printf("找不到\n");
}
else
{
printf("找到了\n");
}
return 0;
}