## Given: a divide and conquer algorithm

- An algorithm that divides the problem of size n into a subproblems, each of size n/b
- Let the cost of each stage (i.e., the work to divide the problem + combine solved subproblems) be described by the function f(n)

## Then, the Master Theorem gives us a cookbook for the algorithm’s running time:

Previous slide | Next slide | Back to first slide | View graphic version |