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

build

Browse Source
This commit is contained in:
krahets
2023-02-26 19:22:52 +08:00
parent 8e0872643c
commit cf26cd551a
17 changed files with 20 additions and 42 deletions
Download Patch File Download Diff File Expand all files Collapse all files
chapter_searching/binary_search.md
+1 -1
View File
@@ -29,7 +29,7 @@ $$
首先，我们先采用“双闭区间”的表示，在数组 `nums` 中查找目标元素 `target` 的对应索引。
=== "<1>"
![binary_search_step1](binary_search.assets/binary_search_step1.png)
![二分查找步骤](binary_search.assets/binary_search_step1.png)
=== "<2>"
![binary_search_step2](binary_search.assets/binary_search_step2.png)
chapter_searching/summary.md
-2
View File
@@ -8,8 +8,6 @@ comments: true
- 二分查找利用数据的有序性，通过循环不断缩小一半搜索区间来实现查找，其要求输入数据是有序的，并且仅适用于数组或基于数组实现的数据结构。
- 哈希查找借助哈希表来实现常数阶时间复杂度的查找操作，体现以空间换时间的算法思想。
<p align="center"> Table. 三种查找方法对比 </p>
<div class="center-table" markdown>
| | 线性查找 | 二分查找 | 哈希查找 |