Divide & Conquer
Recursively break problems into smaller subproblems, solve each, then combine results.
Tower of Hanoi
Recursively move a stack of disks between pegs using an auxiliary peg.
Closest Pair of Points
Finds the two closest points in a 2D plane in O(n log n) time.
Maximum Subarray (D&C)
Finds the max-sum subarray by dividing the array and combining across the midpoint.
Median of Two Sorted Arrays
Finds the median of two sorted arrays in O(log n) via binary search.