mirror of
https://github.com/krahets/hello-algo.git
synced 2026-07-23 03:46:05 +00:00
krahets
24 lines
775 B
Markdown
24 lines
775 B
Markdown
---
|
|
comments: true
|
|
icon: material/set-split
|
|
---
|
|
|
|
# Chapter 12. Divide and Conquer
|
|
|
|
{ class="cover-image" }
|
|
|
|
!!! abstract
|
|
|
|
Difficult problems are decomposed layer by layer, with each decomposition making them simpler.
|
|
|
|
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 Hanota Problem](hanota_problem.md)
|
|
- [12.5 Summary](summary.md)
|
|
- [12.6 Exercises](exercises.md)
|