mirror of
https://github.com/krahets/hello-algo.git
synced 2026-08-22 08:17:15 +00:00
build
This commit is contained in:
@@ -0,0 +1,22 @@
|
||||
---
|
||||
comments: true
|
||||
icon: material/set-split
|
||||
---
|
||||
|
||||
# Chapter 12. Divide and conquer
|
||||
|
||||
{ class="cover-image" }
|
||||
|
||||
!!! abstract
|
||||
|
||||
Difficult problems are decomposed layer by layer, each decomposition making them simpler.
|
||||
|
||||
Divide and conquer reveals an important truth: start with simplicity, and nothing is complex anymore.
|
||||
|
||||
## 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.5 Summary](summary.md)
|
||||
Reference in New Issue
Block a user