写代码可以在整型有序数组中查找想要的数字，找到了返回下标，找不到返回 - 1

利用折半查找算法
具体代码块如下：

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
int main(){
	int arr[] = { 32, 33, 34, 65, 76, 89, 97, 123, 332, 334, 456, 778, 990 };
	int left = 0;
	int right = sizeof(arr) / sizeof(arr[0]) - 1;
	int key;
	int mid = 0;
	printf("输入你想要找的数\n");
	scanf("%d", &key);
	while (left <= right){
		mid = (left + right) / 2;
		if (arr[mid] > key){
			right = mid - 1;
		}
		else if (arr[mid] < key){
			left = mid + 1;
		}
		else
			break;
	}
	if (left <= right){
		printf("找到了,下标是%d", mid);
	}
	else{
		return -1;
	}
	system("pause");
	return 0;
}