C语言数据结构之二分法查找详解_C 语言

if (mid < goal)
		{
			left = mid + 1;
		}

else if (mid > goal)
		{
			right = mid - 1;
		}

else
		{
			printf("你找到了，下标为：%d", mid);
			break;
		}

	if (left > right)
		printf("找不到");

#include<stdio.h>//在数组中找到某个数,二分查找
int main()
{
	int goal = 7;
	int arr[10] = { 1,2,3,4,5,6,7,8,9,10 };
	int sz = sizeof(arr) / sizeof arr[0];
	int left = 0; int right = sz - 1;
	while (left <= right)
	{
		int mid = (left + right) / 2;
		if (mid < goal)
		{
			left = mid + 1;
		}
 
		else if (mid > goal)
		{
			right = mid - 1;
		}
		else
		{
			printf("找到了，下标为：%d", mid);
			break;
		}
	}
	if (left > right)
		printf("找不到");
	return 0;
}