hello-algo/en/docs/chapter_divide_and_conquer/index.md

comments, icon

comments	icon
true	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
• 12.2   Divide and Conquer Search Strategy
• 12.3   Building a Binary Tree Problem
• 12.4   Hanota Problem
• 12.5   Summary