二分查找，折半查找

最新推荐文章于 2022-12-03 22:15:14 发布

视嵌

最新推荐文章于 2022-12-03 22:15:14 发布

阅读量124

点赞数 1

分类专栏：考研数据结构复习代码文章标签：二分查找折半查找

本文链接：https://blog.csdn.net/shitou123xsx/article/details/99481008

版权

考研数据结构复习代码专栏收录该内容

16 篇文章 0 订阅

订阅专栏

算法列表

int B_search(SSTable ST, ElemType key)

#define ElemType int
typedef struct {
	ElemType *elem;
	int length;
}SSTable;
//二分查找
int  B_search(SSTable ST, ElemType key)
{
	int low = 0, high = ST.length - 1;
	int j = 0;
	while (low <= high)
	{
		int mid = (low + high) / 2;
		j++;
		if (ST.elem[mid] == key)
		{
			std::cout << "共执行：" <<  j<< "次" << std::endl;
			return mid;
		}
		else if (ST.elem[mid] < key)
			low = mid + 1;
		else
			high = mid - 1;
	}
}