Divide and conquer is a method of solving computational problems & designing algorithms where a larger problem is recursively broken down (divide) into smaller subproblems until they are solvable (conquer), and the then the algorithm can combine (optional) easy solutions into a solution for the larger problem.