Divide and Conquer

Problems on divide and conquer, including splitting an array in halves and combining the answers, counting inversions with merge sort, closest pair of points, recursive patterns and fractals, and fast exponentiation.

The recursion and sorting articles in the Basics section cover the building blocks. Related problem sets are under Sorting and Dynamic programming optimization.