// 二分查找算法
int HalfSearch(int arr[],int length, int key)
{
int low = 0;
int high = length - 1;
while (low <= high)
{
int mid = low + (high - low) / 2; //注意这种写法
//int mid = (low + high) / 2;
if (key < arr[mid])
{
high = mid - 1;
}
else if (key > arr[mid])
{
low = mid + 1;
}
else
{
return mid;
}
}
return -1;
}
C++ 二分查找算法
最新推荐文章于 2023-11-19 07:00:00 发布