折半查找

# include <stdio.h>

int Binary_Search(int* arr, int n, int key) {
	int low, high, mid;
	low = 0;
	high = n - 1;
	while (low <= high) {
		mid = (low + high) / 2;  //折半
		if (key < arr[mid]) {
			high = mid - 1;
		} else if (key > arr[mid]) {
			low = mid + 1;
		} else {
			return mid;
		}
	}

	return -1;
}

int main() {
	
	int arr[10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
	int key = 0;
	printf("请输入想要查找的值:\n");
	scanf("%d", &key);
	int result = Binary_Search(arr, 10, key);
	if (result != -1) {
		printf("查找成功 %d\n", arr[result]);
	} else {
	    printf("不存在该元素！");
	}

}