二分查找测试

小记

二分查找实现思想：
https://blog.csdn.net/qq_42680327/article/details/81734842?biz_id=102&utm_term=C%E5%AE%9E%E7%8E%B0%E6%8A%98%E5%8D%8A%E6%9F%A5%E6%89%BE&utm_medium=distribute.pc_search_result.none-task-blog-2_allsobaiduweb~default-0-81734842&spm=1018.2118.3001.4187
参考上述博客

测试代码：

#include <stdio.h>
void main()
{
	int a[10],num,low,high,mid,i,flag=0;
	for(i=0;i<=9;i++)
	{
		a[i]=i;
	}
	printf("input finding number:");
	scanf("%d",&num);
	low=0;
	high=9;
	while(low<=high)
	{
		mid=(low+high)/2;
		printf("low=%d,mid=%d,high=%d\n",low,mid,high);
		if(a[mid]>num)
		{
			high=mid-1;
		}
		if(a[mid]<num)
		{
			low=mid+1;
		}
		if(a[mid]==num)
		{
			flag=1;
			break;
		}
	}
	if(flag)
	{
		printf("found!\n");
	}
	else
	{
		printf("not found!\n");
	}
}

效果：