#include <stdio.h>
int main()
{
int arr[] = {1,2,3,4,5,6,7,8}; // 有序数组
int n = sizeof(arr) / sizeof(arr[0]); // 数组中元素的数量
int k = 10;
//int n1 = sizeof(arr);//数组总大小
//int n2 = sizeof(arr[0]);//单个元素大小
int left = 0;
int right = n-1;
int mid;
while (left <= right)
{
mid = (left + right) / 2;
if (arr[mid] < k)
left = mid + 1;
else if (arr[mid] > k)
right = mid - 1;
else
{
printf("找到了,位置下标:%d\n", mid);
break;
}
}
if(left>right)
printf("未找到\n");
return 0;
}