二分法查找
#include <stdio.h>
int main()
{
int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
int k = 7;
int left = 0;
int sz = sizeof(arr) / sizeof(arr[0]);
int right = sz - 1;
while (left <= right)
{
int mid = (right - left) / 2 + left;
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("找不到");
}
return 0;
}
int main()
{
int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
int k = 7;
int left = 0;
int sz = sizeof(arr) / sizeof(arr[0]);
int right = sz - 1;
while (left <= right)
{
int mid = (right - left) / 2 + left;
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("找不到");
}
return 0;
}
全部评论
相关推荐
01-20 11:00
广东实验中学 算法工程师 点赞 评论 收藏
分享
点赞 评论 收藏
分享
