mirror of
https://github.com/krahets/hello-algo.git
synced 2026-08-19 15:00:58 +00:00
build
This commit is contained in:
@@ -11,7 +11,7 @@ comments: true
|
||||
|
||||

|
||||
|
||||
<p align="center"> Fig. 归并排序的划分与合并阶段 </p>
|
||||
<p align="center"> 图:归并排序的划分与合并阶段 </p>
|
||||
|
||||
## 11.6.1. 算法流程
|
||||
|
||||
@@ -52,6 +52,8 @@ comments: true
|
||||
=== "<10>"
|
||||

|
||||
|
||||
<p align="center"> 图:归并排序步骤 </p>
|
||||
|
||||
观察发现,归并排序的递归顺序与二叉树的后序遍历相同,具体来看:
|
||||
|
||||
- **后序遍历**:先递归左子树,再递归右子树,最后处理根节点。
|
||||
|
||||
Reference in New Issue
Block a user