c语言二分查找

二分查找最重要的条件是数组有序

代码如下：

#include<stdio.h>
int main()
{
	int arr[101];
	int k,n;
	scanf("%d %d", &k,&n);//输入要找的值
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &arr[i]);
	}
	int flag = 0;
	int left = 0;
	int right = n - 1;
	while (left <= right)
	{
		int mid = (right+left) / 2;
		if (arr[mid] > k)
		{
			right = mid - 1;
		}
		else if (arr[mid] < k)
		{
			left = mid + 1;
		}
		else if(arr[mid]==k)
		{
			flag = 1;
			printf("找到了，下标是：%d", mid);
			break;
		}
	}
	if (flag == 0)
		printf("找不到");
	return 0;
}