查找的练习

整型二分法

#include <stdio.h> 
void main ()

{
	int a[8]={-12,0,6,23,56,80,100,115};//必须是冒泡排序
	int input,low,high,mid;//四个值，为整形
	low=0;
	high=7;
	scanf("%d",&n);
	while(1)
	{mid=(high+low)/2;
		if (a [mid] != input)
		{
			if(a[mid]<n)
			{low=mid+1;}
			if(a[mid]>n)
			{high=mid-1;}//加一减一避免失去精度后的死循环
			if(high<low)
			{printf("no");break;}
		}
		else{
			printf("yes");
			break;}
	}
}