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, 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
• 12.2   Divide and conquer search strategy
• 12.3   Building binary tree problem
• 12.4   Tower of Hanoi Problem
• 12.5   Summary