algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 21:24:53 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update the symbols of the animations.

Browse Source
This commit is contained in:
krahets
2023-02-22 00:57:43 +08:00
parent 0b72fef381
commit 3daaf30f23
10 changed files with 89 additions and 89 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
docs/chapter_sorting/bubble_sort.md
View File

@ -14,25 +14,25 @@ comments: true
完成此次冒泡操作后，**数组最大元素已在正确位置，接下来只需排序剩余 $n - 1$ 个元素**。
=== "Step 1"
=== "<1>"
![bubble_operation_step1](bubble_sort.assets/bubble_operation_step1.png)
=== "Step 2"
=== "<2>"
![bubble_operation_step2](bubble_sort.assets/bubble_operation_step2.png)
=== "Step 3"
=== "<3>"
![bubble_operation_step3](bubble_sort.assets/bubble_operation_step3.png)
=== "Step 4"
=== "<4>"
![bubble_operation_step4](bubble_sort.assets/bubble_operation_step4.png)
=== "Step 5"
=== "<5>"
![bubble_operation_step5](bubble_sort.assets/bubble_operation_step5.png)
=== "Step 6"
=== "<6>"
![bubble_operation_step6](bubble_sort.assets/bubble_operation_step6.png)
=== "Step 7"
=== "<7>"
![bubble_operation_step7](bubble_sort.assets/bubble_operation_step7.png)
<p align="center"> Fig. 冒泡操作 </p>

20
docs/chapter_sorting/merge_sort.md
View File

@ -24,34 +24,34 @@ comments: true
需要注意，由于从长度为 1 的子数组开始合并，所以 **每个子数组都是有序的**。因此，合并任务本质是要 **将两个有序子数组合并为一个有序数组**。
=== "Step1"
=== "<1>"
![merge_sort_step1](merge_sort.assets/merge_sort_step1.png)
=== "Step2"
=== "<2>"
![merge_sort_step2](merge_sort.assets/merge_sort_step2.png)
=== "Step3"
=== "<3>"
![merge_sort_step3](merge_sort.assets/merge_sort_step3.png)
=== "Step4"
=== "<4>"
![merge_sort_step4](merge_sort.assets/merge_sort_step4.png)
=== "Step5"
=== "<5>"
![merge_sort_step5](merge_sort.assets/merge_sort_step5.png)
=== "Step6"
=== "<6>"
![merge_sort_step6](merge_sort.assets/merge_sort_step6.png)
=== "Step7"
=== "<7>"
![merge_sort_step7](merge_sort.assets/merge_sort_step7.png)
=== "Step8"
=== "<8>"
![merge_sort_step8](merge_sort.assets/merge_sort_step8.png)
=== "Step9"
=== "<9>"
![merge_sort_step9](merge_sort.assets/merge_sort_step9.png)
=== "Step10"
=== "<10>"
![merge_sort_step10](merge_sort.assets/merge_sort_step10.png)
观察发现，归并排序的递归顺序就是二叉树的「后序遍历」。

18
docs/chapter_sorting/quick_sort.md
View File

@ -14,31 +14,31 @@ comments: true
「哨兵划分」执行完毕后，原数组被划分成两个部分，即 **左子数组** 和 **右子数组**，且满足 **左子数组任意元素 < 基准数 < 右子数组任意元素**。因此，接下来我们只需要排序两个子数组即可。
=== "Step 1"
=== "<1>"
![pivot_division_step1](quick_sort.assets/pivot_division_step1.png)
=== "Step 2"
=== "<2>"
![pivot_division_step2](quick_sort.assets/pivot_division_step2.png)
=== "Step 3"
=== "<3>"
![pivot_division_step3](quick_sort.assets/pivot_division_step3.png)
=== "Step 4"
=== "<4>"
![pivot_division_step4](quick_sort.assets/pivot_division_step4.png)
=== "Step 5"
=== "<5>"
![pivot_division_step5](quick_sort.assets/pivot_division_step5.png)
=== "Step 6"
=== "<6>"
![pivot_division_step6](quick_sort.assets/pivot_division_step6.png)
=== "Step 7"
=== "<7>"
![pivot_division_step7](quick_sort.assets/pivot_division_step7.png)
=== "Step 8"
=== "<8>"
![pivot_division_step8](quick_sort.assets/pivot_division_step8.png)
=== "Step 9"
=== "<9>"
![pivot_division_step9](quick_sort.assets/pivot_division_step9.png)
<p align="center"> Fig. 哨兵划分 </p>