C++二分查找

今天在牛客上做题，遇到二分查找的问题，特地来复习复习。

二分查找的算法思想很简单，就不多赘述，直接上代码。

二分查找，找到返回目标下标，未找到返回-1

#include <iostream>
#include <vector>
#include <time.h>
#include <algorithm>
using namespace std;


void InitData(vector<int>& arr);
void ShowData(const vector<int>& arr);
void SortData(vector<int>& arr);
void SearchTest(const vector<int>& arr,int type = 1);//1.非递归2.递归
//非递归
int BinarySearchA(int target,const vector<int>& arr);
//递归
int BinarySearchB(int target, const vector<int>& arr, int low, int high);



int main()
{
	vector<int> arr;
	InitData(arr);
	ShowData(arr);
	SortData(arr);
	ShowData(arr);
	SearchTest(arr,2);

	cin.get();
	return 0;
}


void InitData(vector<int>& arr)
{
	srand((unsigned)time(NULL));
	arr.clear();
	const int nCapcity = 10;
	arr.reserve(nCapcity);
	for (int i = 0; i < nCapcity; i++)
	{
		arr.push_back(rand() % 10);
	}
}


void ShowData(const vector<int>& arr)
{
	cout << endl;
	for (auto it:arr)
	{
		cout << it << '\t';
	}
	cout << endl;
}

void SortData(vector<int>& arr)
{
	sort(arr.begin(), arr.end());
}


void SearchTest(const vector<int>& arr, int type)
{
	const int target(6);

	if (type == 1)
	{
		int ret = BinarySearchA(target, arr);
		if (ret >= 0)
		{
		cout << "Found " << target << " 下标位置：" << ret << endl;
		}
		else
		{
		cout << "Not Found " << target << endl;
		}
	}
	else if (type == 2)
	{
		int left = 0;
		int right = arr.size() - 1;
		int ret = BinarySearchB(target, arr, left, right);
		if (ret >= 0)
		{
			cout << "Found " << target << " 下标位置：" << ret << endl;
		}
		else
		{
			cout << "Not Found " << target << endl;
		}
	}
}


int BinarySearchA(int target, const vector<int>& arr)
{
	int low(0);
	int high(arr.size() - 1);

	while (low <= high)
	{
		int mid = (low + high) / 2;
		auto nMiddle = arr[mid];
		if (nMiddle == target)
		{
			return mid;
		}
		if (nMiddle < target)
		{
			low = mid + 1;
		}
		else
		{
			high = mid - 1;
		}
	}

	return -1;
}

int BinarySearchB(int target, const vector<int>& arr, int low, int high)
{
	if (low>high)
	{
		return -1;
	}
	
	int mid = (low + high) / 2;
	if (arr[mid] == target)
	{
		return mid;
	}
	else if (arr[mid] < target)
	{
		return BinarySearchB(target, arr, mid + 1, high);
	}
	else if (arr[mid] > target)
	{
		return BinarySearchB(target, arr, low, mid - 1);
	}
	
	return -1;
}