CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-05 11:41:22 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add captions for all the animations.

Browse Source
This commit is contained in:
krahets
2023-02-26 19:22:46 +08:00
parent 7aa44d212c
commit 23cda5e225
13 changed files with 20 additions and 20 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
docs/chapter_sorting/bubble_sort.md
View File

@@ -11,7 +11,7 @@
完成此次冒泡操作后，**数组最大元素已在正确位置，接下来只需排序剩余 $n - 1$ 个元素**。
=== "<1>"
![bubble_operation_step1](bubble_sort.assets/bubble_operation_step1.png)
![冒泡操作步骤](bubble_sort.assets/bubble_operation_step1.png)
=== "<2>"
![bubble_operation_step2](bubble_sort.assets/bubble_operation_step2.png)

2
docs/chapter_sorting/merge_sort.md
View File

@@ -19,7 +19,7 @@
需要注意，由于从长度为 1 的子数组开始合并，所以 **每个子数组都是有序的**。因此，合并任务本质是要 **将两个有序子数组合并为一个有序数组**。
=== "<1>"
![merge_sort_step1](merge_sort.assets/merge_sort_step1.png)
![归并排序步骤](merge_sort.assets/merge_sort_step1.png)
=== "<2>"
![merge_sort_step2](merge_sort.assets/merge_sort_step2.png)

2
docs/chapter_sorting/quick_sort.md
View File

@@ -11,7 +11,7 @@
「哨兵划分」执行完毕后，原数组被划分成两个部分，即 **左子数组** 和 **右子数组**，且满足 **左子数组任意元素 < 基准数 < 右子数组任意元素**。因此，接下来我们只需要排序两个子数组即可。
=== "<1>"
![pivot_division_step1](quick_sort.assets/pivot_division_step1.png)
![哨兵划分步骤](quick_sort.assets/pivot_division_step1.png)
=== "<2>"
![pivot_division_step2](quick_sort.assets/pivot_division_step2.png)