C语言-穷举法和二分法从数组中查找数字

#include <stdio.h>
int main() {
	int arr[] = { 1,1,2,2,3,4,5,6,7,8,9 };
	int n = 1;
	//穷举法
	for (int i = 0; i < sizeof(arr) / sizeof(arr[0]); i++)
	{
		if (n == arr[i])
		{
			printf("%d\n", arr[i]);
			printf("%d\n", i);
		}
	}

	//二分法
	int sz = sizeof(arr) / sizeof(arr[0]);
	int right = sz - 1;
	int left = 0;

	while (left <= right)
	{
		int mid = (left + right)/2;
		if (arr[mid] < n)
		{
			left = mid + 1;
		}
		else if (arr[mid] > n)
		{
			right = mid - 1;
		}
		else
		{
			printf("找到了，下标是%d\n", mid);
			break;
		}

		if (left > right)
		{
			printf("找不到");
		}
	}
	return 0;
}