二分查找

最新推荐文章于 2022-11-14 17:59:10 发布

Big_Study_Father

最新推荐文章于 2022-11-14 17:59:10 发布

阅读量274

点赞数

本文链接：https://blog.csdn.net/Big_Study_Father/article/details/79193787

版权

#include<iostream>
using namespace std;
int p[11010], num;
int find(int a) {
	int left = p[0], right = p[num-1];
	while (left < right) {
		int mid = (left+right)/2;
		//cout << mid << "---" << endl;
		if (a < p[mid])right = mid - 1;
		else if (a > p[mid]) left = mid + 1;
		else return mid;
	}
	return -1;
}
int main()
{
	int findnum, count=0;
	cin >> findnum>>num ;
	for (int i = 0; count < num; i+=2) p[count++] = i;
	for (int i = 0; i < num; i++)  cout << p[i] << endl;
	cout << find(findnum) << endl;
}