xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-08-25 01:27:13 +00:00
Code Issues Packages Projects Releases Wiki Activity

build

Browse Source
This commit is contained in:
krahets
2026-04-03 18:46:15 +08:00
parent 377736b1bd
commit 9d21ca86b0
352 changed files with 46563 additions and 11262 deletions
Download Patch File Download Diff File Expand all files Collapse all files
en/docs/chapter_divide_and_conquer/index.md
+2 -2
View File
@@ -11,12 +11,12 @@ icon: material/set-split
Difficult problems are decomposed layer by layer, with each decomposition making them simpler.
Divide and conquer reveals an important truth: start with simplicity, and nothing remains complex.
Divide and conquer reveals an important truth: start with what is simple, and nothing remains complex.
## Chapter contents
- [12.1   Divide and Conquer Algorithms](divide_and_conquer.md)
- [12.2   Divide and Conquer Search Strategy](binary_search_recur.md)
- [12.3   Building a Binary Tree Problem](build_binary_tree_problem.md)
- [12.4   Hanoi Tower Problem](hanota_problem.md)
- [12.4   Hanota Problem](hanota_problem.md)
- [12.5   Summary](summary.md)