---
comments: true
icon: material/set-split
---

# Chapter 12.   Divide and conquer

![Divide and Conquer](../assets/covers/chapter_divide_and_conquer.jpg){ class="cover-image" }

!!! 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](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)