Merge Sort: Divide and Conquer Sorting
John von Neumann invented merge sort in 1945, making it one of the oldest sorting algorithms still in widespread use. That longevity isn’t accidental. While flashier algorithms like quicksort get…
Read more →Conquer
Divide and Conquer: Algorithm Design Paradigm
Divide and conquer is one of the most powerful algorithm design paradigms in computer science. The concept is deceptively simple: break a problem into smaller subproblems, solve them independently,…
Read more →Centroid Decomposition: Divide and Conquer on Trees
Standard divide and conquer works beautifully on arrays because splitting in half guarantees O(log n) depth. Trees don’t offer this luxury. A naive approach—picking an arbitrary node and recursing on…
Read more →Binary Search: Divide and Conquer Search
Binary search is the canonical divide and conquer algorithm. Given a sorted collection, it finds a target value by repeatedly dividing the search space in half. Each comparison eliminates 50% of…
Read more →