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

build

Browse Source
This commit is contained in:
krahets
2025-12-31 19:37:45 +08:00
parent 29ec0c699d
commit 3c9d5689c4
279 changed files with 40895 additions and 16087 deletions
Download Patch File Download Diff File Expand all files Collapse all files
en/docs/chapter_divide_and_conquer/index.md
+7 -7
View File
@@ -3,20 +3,20 @@ comments: true
icon: material/set-split
---
# Chapter 12.   Divide and conquer
# Chapter 12.   Divide and Conquer
![Divide and Conquer](../assets/covers/chapter_divide_and_conquer.jpg){ class="cover-image" }
![Divide and conquer](../assets/covers/chapter_divide_and_conquer.jpg){ class="cover-image" }
!!! abstract
Difficult problems are decomposed layer by layer, with each decomposition making them simpler.
Divide and conquer unveils a profound truth: begin with simplicity, and complexity dissolves.
Divide and conquer reveals an important truth: start with simplicity, 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 binary tree problem](build_binary_tree_problem.md)
- [12.4   Tower of Hanoi Problem](hanota_problem.md)
- [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.5   Summary](summary.md)