分析
代码:
int main()
{
int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
int k = 7;//查找
int sz = sizeof(arr) / sizeof(arr[0]);
int left = 0;
int right = sz - 1;
while (left<=right) {
int mid = (left + right) / 2;
if (arr[mid] <k)
{
left = mid + 1;
}
else if (arr[mid] > k)
{
right = mid - 1;
}
else
{
printf("找到了%d下标是", mid);
break;
}
}
if(left>right){
printf("找不到");
}
return 0;
}