#include<stdio.h>
int main()
{
int i = 0;
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;
int n = 0;
scanf("%d",&i);
while (left <= right)
{
n = (right+left) / 2;
if (arr[n] < i)
left = n + 1;
else if (arr[n] > i)
right = n - 1;
else {
printf("下标=%d\n", n);
break;
}
}
if (left > right)
{
printf("序列无该数\n");
}
return 0;
}
二分/折半查找算法实例
最新推荐文章于 2021-10-27 16:15:22 发布