编辑代码

#include<iostream>
using namespace std;
int BinarySearch(int arr[], int len, int target) {
	int low = 0;
	int high = len;
	int mid = 0;
	while (low <= high) {
		mid = (low + high) / 2;
		if (target < arr[mid]) high = mid - 1;
		else if (target > arr[mid]) low = mid + 1;
		else return mid;
	}
	return -1;
}
int main() {
	int array[] = { 7,14,18,21,23,29,31,5,38,42,46,49,52 };
	int arrayLen = sizeof(array) / sizeof(array[0]);
	int index = BinarySearch(array, arrayLen, 52);
	if (index != -1) {
		cout << "查找" << array[index] << "成功";
	}
	else {
		cout << "查找失败";
	}
	return 0;
}