Chapter 12. Divide and conquer¶
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.
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