减治法——二分查找算法(Decrease and Conquer by a Factor - Binary Search Algorithm)

最新推荐文章于 2024-06-13 14:44:03 发布

UoM_XiaoShuaiShuai

最新推荐文章于 2024-06-13 14:44:03 发布

阅读量1.6k

点赞数

分类专栏：算法文章标签：二分查找算法搜索减治法 java

本文链接：https://blog.csdn.net/UoM_XiaoShuaiShuai/article/details/73028713

版权

本文介绍了减治法的概念，包括减治法常数和因子两种方式，并详细讲解了基于减治法因子的二分查找算法，阐述其工作原理、伪代码和时间复杂度。此外，还提供了二分查找的Java实现及运行结果。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

减治法——二分查找算法(Decrease and Conquer by a Factor - Binary Search Algorithm)

减治法简介(Introduction)
Decease-and-Conquer is a famous algorithmic design technique. basically, in the approach the size of problem will be reduced by a constant or a factor in each interaction of the algorithm.

Decrease-and-Conquer-by-a-Constatnt: for example, to sort an array of length n. We firstly sort n-1 elements, and then place the last element in its right position. In second iteration, it is sorting n-2 elements, and so on. Problem: n -> n-1 -> n-2 -> … -> 2 -> 1.

Decrease-and-Conquer-by-a-factor: for example, to search a key in an sorted array. We firstly check whether the middle element is the key, if it is, we are done; If the key is greater, go to right portion. Otherwise go to left portion. In this case, the size of problem is reduced by half in each iteration