二分查找及其变种,c++ upper_bound,c++ lower_bound

---

经典二分 在[begin,end)之间查找val,返回val下标

// 经典二分 在[begin,end)之间查找val,返回val下标
int* binary_search(int* begin, int* end, int val)
{
	int n = end - begin;
	int l = begin - begin, r = end - begin - 1;
	while (l <= r)
	{
		int mid = l + (r - l) / 2;
		if (*(begin + mid) == val)
		{
			return begin+mid;
		}
		else if (*(begin + mid) < val)
		{
			l = mid + 1;
		}
		else
		{
			r = mid - 1;
		}
	}
	return end;
}

二分变种：upper_bound 在[begin,end)之间查找第一个大于val,返回val下标

// upper_bound 在[begin,end)之间查找第一个大于val,返回val下标
int* binary_search2(int* begin, int* end, int val)
{
	int n = end - begin;
	int l = begin - begin, r = end - begin - 1;
	while (l <= r)
	{
		int mid = l + (r - l) / 2;
		if (*(begin + mid) <= val)
		{
			l = mid + 1;
		}
		else
		{
			r = mid - 1;
		}
	}
	return begin+l;
}

二分变种：lower_bound 在[begin,end)之间查找第一个大于等于val的元素,返回val下标

// lower_bound 在[begin,end)之间查找第一个大于等于val的元素,返回val下标
int* binary_search3(int* begin, int* end, int val)
{
	int n = end - begin;
	int l = begin - begin, r = end - begin - 1;
	while (l <= r)
	{
		int mid = l + (r - l) / 2;
		if (*(begin + mid) < val)
		{
			l = mid + 1;
		}
		else
		{
			r = mid - 1;
		}
	}
	return begin + l;
}

与c++标准upper_bound, lower_bound对比

int main(int argc, char** argv)
{

	/*int n[6] = { 1,2,3,4,5,6 };
	int p = 1;
	cout << binary_search(n, n + 6, p)-n<<"\n";*/

	/*int n2[7] = { 1,2,3,3,4,5,6 };
	int p = 5;
	cout << binary_search2(n2, n2 + 7, p) - n2 << "\n";
	cout << upper_bound(n2, n2 + 7, p)-n2 << "\n";*/

	int n3[7] = { 1,2,3,3,4,5,6 };
	int p = 4;
	cout << binary_search3(n3, n3 + 7, p) - n3 << "\n";
	cout << lower_bound(n3, n3 + 7, p)-n3 << "\n";

	return 0;
}