如何使用——折半查找

折半查找--------在一个有序数组中查找具体的某个数组n
#include<stdio.h>
int main()
{
	int arr[10] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
	int key = 8;
	int left = 0;
	int right = sizeof(arr) / sizeof(arr[0]);
	
	while (left <= right)
	{
		int mid = left - ((left - right) >> 1);
		if (arr[mid] < arr[key])
		{
			left = mid + 1;
		}
		else if (arr[mid]>arr[key])
		{
			right = mid - 1;

		}
		else
		{
			printf("找到了\n");
			break;
		}
	}
	if (left > right)
	{
		printf("找不到\n");
	}
	return 0;
}