二分搜索-查找边界

/*
* 前提是数组已经有序
*/
#include<cstdio>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<ctime>
#include<vector>
using namespace std;

#define N 100005
#define pi 3.14159
typedef long long ll;

int a[N];

int binarySearch1(int n, int low, int high)//要查找的元素在数组中有多个，找出第一个在数组中的下标
{

	int mid;
	while (low < high)
	{
		mid = low + high >> 1;
		if (a[mid] >= n)
			high = mid;
		else low = mid + 1;
	}
	if (a[low] == n) return low;//相等代表找到
	else return-1;
}
int binarySearch2(int n, int low, int high)//要查找的元素在数组中有多个，找出最后一个在数组中的下标
{
	int mid;
	while (low < high)
	{
		mid = low + high + 1 >> 1;
		if (a[mid] <= n) low = mid;
		else  high = mid - 1;
	}
	if (a[low] == n) return low;//相等代表找到
	else return-1;
}
int main()
{
	int n;//n为数组规模
	scanf("%d", &n);
	for (int i = 0; i < n; i++)
		scanf("%d", &a[i]);//输入一组有序元素
	int num;//num为待查找元素
	scanf("%d", &num);
	printf("%d ", binarySearch1(num, 0, n - 1));
	printf("%d\n", binarySearch2(num, 0, n - 1));

	return 0;
}