Chapter 5

Divide and Conquer: class of algorithmic techniques in which one breaks the input into several parts, solves the problem in each part recursively, and then combines the solutions to these subproblems into an overall solution

Recurrence Relation: bounds the running time recursively in terms of the running time on smaller instances

Divide and conquer strategy may reduce the running time to a lower polynomial from the brute-force polynomial time.