Divide & Conquer

Recursively break problems into smaller subproblems, solve each, then combine results.

Recursively move a stack of disks between pegs using an auxiliary peg.

Finds the two closest points in a 2D plane in O(n log n) time.

Finds the max-sum subarray by dividing the array and combining across the midpoint.

Finds the median of two sorted arrays in O(log n) via binary search.