C语言折半查找法

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
int Dichotomy(int Arr[],int size,int tofind) {
	int left = 0;
	int reght = size - 1;
	while (left <= reght) {
		int mid = (left + reght) / 2;
		if (Arr[mid] > tofind)	
			reght = mid - 1;
		else if (Arr[mid] < tofind)
			left = mid + 1;
		else if (Arr[mid] == tofind)
			return mid;
	}
	return -1;
}
int main() {
	int A, key;
	int Arr[10] = { 1, 2, 3, 4, 5, 6, 7, 8, 9,10 };
	int size = sizeof(Arr) / sizeof(Arr[0]);
	while (1) {
		printf("请输入任意0-9的个位数\n查找其在本数组中的位置\n");
		scanf("%d", &key);
		A = Dichotomy(Arr, size, key);
		if (A>=0)
		printf("该数字在本数组中的位置下标为：%d\n\n", A);
		else
		{
			printf("-1\n该数字不在本数组内\n\n");
		}
	}
	system("pause");
	return 0;

}