int binary_research(vector<int>& arr, int left, int right, int element)
{
while (left <= right)
{
int mid = (left + right) / 2;
if (arr[mid]>element)
{
right = mid - 1;
}
else if (arr[mid]<element)
{
left = mid + 1;
}
else
{
return mid;
}
}
return -1;
}
二叉查找算法实现
猜你喜欢
转载自blog.csdn.net/fsfsfsdfsdfdr/article/details/82733503
今日推荐
周排行