折半查法

void Er(int n)
{

int arr[15] = {15,14,13,12,11,10,9,8,7,6,5,4,3,2,1};
int len = sizeof(arr) / sizeof(arr[0]);
int low = 0;
int high =len-1;
int mid;
while(low <= high)
{
	mid = (low+high)/2;
	if(n == arr[mid])
	{
		printf("%d 在此数组内\n",n);
		break;
	}
	else if(n > arr[mid])
	{
		high = mid-1;
	}
	else 
		low = mid+1;
}
if(low > high)
	{
		printf("%d 不在此数组内\n",n);
	}

}
int main()
{
Er(0);
Er(6);
Er(16);
return 0;
}