Divide and Conquer

Design and Analysis of Algorithms

Four optimization problems, each solved several ways (dynamic programming, backtracking, divide and conquer, greedy) with a complexity analysis of every attempt.