C语言：折半查找
//折半查找
#include <stdio.h>
int dichotomy(int m,int arr[],int left,int right)
{
int mid;
while(left <= right)
{
mid = left - (left - right)/2;
if(m < mid)
right = mid - 1;
else if(m > mid)
left = mid + 1;
else
return mid;
}
return -1;
}
int main()
{
int a[] = {2,4,6,8,10,12,14,16,18};
int search;
int find;
printf("请输入您要查找的数字：");
scanf("%d", &search);
find = dichotomy(search,a,0,8);
if(find == -1)
printf("NO find");
else
printf("您要找的数字为：%d\n",find);
return 0;
}
- 上一篇：C语言 猜数字游戏
- 下一篇：戴尔收购EMC对网络安全的启示
相关文章
图文推荐
- 文章
- 推荐
- 热门新闻