#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
int main()
{
int k = 15;
int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
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;
}
C语言折半查找法
最新推荐文章于 2024-09-24 08:48:12 发布