xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-08-14 04:30:58 +00:00
Code Issues Packages Projects Releases Wiki Activity

deploy

Browse Source
This commit is contained in:
krahets
2023-08-20 13:37:20 +08:00
parent 88e0b11361
commit 96fded547b
35 changed files with 777 additions and 716 deletions
Download Patch File Download Diff File Expand all files Collapse all files
chapter_divide_and_conquer/binary_search_recur/index.html
+5 -5
View File
@@ -2424,8 +2424,8 @@
<ul class="md-nav__list" data-md-component="toc" data-md-scrollfix>
<li class="md-nav__item">
<a href="#_1" class="md-nav__link">
基于分治实现二分
<a href="#1" class="md-nav__link">
1. &nbsp; 基于分治实现二分
</a>
</li>
@@ -3376,8 +3376,8 @@
<ul class="md-nav__list" data-md-component="toc" data-md-scrollfix>
<li class="md-nav__item">
<a href="#_1" class="md-nav__link">
基于分治实现二分
<a href="#1" class="md-nav__link">
1. &nbsp; 基于分治实现二分
</a>
</li>
@@ -3423,7 +3423,7 @@
<li><strong>子问题的解无需合并</strong>：二分查找旨在查找一个特定元素，因此不需要将子问题的解进行合并。当子问题得到解决时，原问题也会同时得到解决。</li>
</ul>
<p>分治能够提升搜索效率，本质上是因为暴力搜索每轮只能排除一个选项，<strong>而分治搜索每轮可以排除一半选项</strong>。</p>
<h3 id="_1">基于分治实现二分<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h3>
<h3 id="1">1. &nbsp; 基于分治实现二分<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
<p>在之前的章节中，二分查找是基于递推（迭代）实现的。现在我们基于分治（递归）来实现它。</p>
<div class="admonition question">
<p class="admonition-title">Question</p>