谭浩强c++第三版5-8

#include<iostream>
using namespace std;

//折半查找法在一个排好序的数组中查找

int main()
{
	int a[15],n;
	cout << "输入数组:";
	for (int i = 0; i < 15; i++)
		cin >> a[i];
	cout << "输入要查找的数:";
	cin >> n;
	int begin=0, end=14, mid;
	while (begin <= end)
	{
		mid = (begin + end) / 2;
		if (n == a[mid])
		{
			cout << n << "在数列中第" << mid + 1 << "位。" << endl;
			break;
		}
		else if (n > a[mid])
			begin = mid + 1;
		else end = mid - 1;
		if (begin > end)
			cout << "找不到该数。" << endl;
	}
	return 0;
}