用二分搜索法搜索一个数是否在一个数组中出现，如果出现输出其下标

#include<stdio.h>
#include<stdlib.h>
int Binary_Search(int arr[], int sz, int n,int left, int right)
{
	int mid = 0;
	while(left<=right)
	{
		mid = left-((left-right)>>1);//求这个区间里中间的那个数的下标
		if(arr[mid] == n)
		{
			return mid;
		}
		else if(n<arr[mid])
		{
			right = mid-1;
		}
		else
		{
			left = mid + 1;
		}
	}
	if(left>right)
	{
		return -1;
	}
}
int main()
{
	int arr[] = {0,1,2,3,4,5,6,7,8,9};
	int sz = sizeof(arr)/sizeof(arr[0]);
	int left = 0;//开始查找区间的左下标
	int right = sz - 1;//开始查找区间的右下标
	int count = 0;
	int n = 0;
	printf("请输入要查找的数：\n");
	scanf("%d",&n);
	count = Binary_Search(arr,sz,n,left,right);
	if(count == -1)
	{
		printf("该数组中没有此数。\n");
	}
	else
	{
		printf("找到了，下标为%d。\n",count);
	}
	system("pause");
	return 0;
}