Divide and conquer algorithms

Divide and conquer algorithms work by splitting a larger problem into smaller sub-problems which are then solved recursively and combined to give a solution to the original problem.

Divide and conquer algorithms covered:

• Merge sort
• Finding the closest pair of points
• The master theorem
• Fast integer multiplication