数组查询---二分查询

int FindValue_F(const int* br, int n, int val)//for循环遍历数组查找val
{
	assert(br != nullptr);
	int pos = -1;
	for (int i = 0; i < n; ++i)
	{
		if (br[i] == val)
		{
			pos = i;
			break;
		}
	}
	return pos;
}

int FindValue_W(const int* br, int n, int val)//while循环遍历数组查找val
{
	assert(br != nullptr);
	int pos = n - 1;
	while (pos >= 0 && br[pos] != val)
	{
		--pos;
	}
	return pos;
}


//O(log2^n)
// 二分查询遍历数组查找val（数组中无重复数据）
int FindValue_2(const int* br, int n, int val)
{//二分查询要求：数据在数组中连续，数据在数组中有顺序
	assert(br != nullptr);
	int pos = -1;
	int left = 0; int right = n - 1;

	while (left <= right)
	{
		//int mid = (left + right) / 2;    如果下标太大，left+right会越界
		//int mid=((right-left)>>1)+left;   不建议这样写
		int mid = (right - left) / 2 + left;
		if (val < br[mid])
		{
			right = mid - 1;
		}
		else if (val > br[mid])
		{
			left = mid + 1;
		}
		else
		{
			pos = mid;
			break;
		}
	}
	return pos;
}


// 二分查询遍历数组查找val（数组中存在重复数据，要求返回重复数据最左边的下标）
int FindValue_22(const int* br, int n, int val)
{
	assert(br != nullptr);
	int pos = -1;
	int left = 0; int right = n - 1;

	while (left <= right)
	{
		int mid = (right - left) / 2 + left;
		if (val < br[mid])
		{
			right = mid - 1;
		}
		else if (val > br[mid])
		{
			left = mid + 1;
		}
		//else
		//{//一个下标一个下标的比较，效率低
		//	while (mid > left && br[mid-1] == val) { mid--; }//找到最左边的下标
		//	//while (mid <right && br[mid+1] == val) { mid++; }//找到最右边的下标
		//	pos = mid;
		//	break;
		//}

		else
		{
			if (mid > left && br[mid - 1] == val)
			{
				right = mid - 1;//对于重复的数据依旧进行二分查询，效率提高
			}
			else
			{
				pos = mid;
				break;
			}

		}


	}
	return pos;
}