二分法五行核心代码

#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 1000;
int main()
{
	int n;
	int a[maxn];
	while (cin >> n)
	{
		for (int i = 1; i <= n; i++)
			cin >> a[i];
		sort(a + 1, a + n + 1);
		cout << "排序后为:" << endl;
		for (int i = 1; i <= n; i++)
		{
			cout << a[i]<<" ";

		}
		cout << endl;
		int key;
		cin >> key;
		int low = 1, high = n, mid;
		while (low <= high)
		{
			mid = (low + high) / 2;
			if (a[mid] == key) break;
			if (a[mid] > key) high = mid - 1;
			else
				low = mid + 1;
		}
		cout << "位置为:" << mid << endl;
	}
}