KnowraDivide-and-conquer algorithmLinked fromLinked fromThe 8 pages that link to Divide-and-conquer algorithm, each with the reason it gives.All 8Related 2Narrower topic 5Compared with 1Recurrence relationRelated: Recurrences describe the running time of recursive divide-and-conquer procedures.Dynamic programmingCompared with: Unlike dynamic programming, its subproblems typically do not overlap.RecursionRelated: It commonly implements its repeated subdivision through recursive calls.Binary searchNarrower topic: Binary search is a particularly simple divide-and-conquer algorithm that keeps only one subproblem.Merge sortNarrower topic: Merge sort applies this strategy by splitting sequences and combining sorted results.QuicksortNarrower topic: Quicksort divides by partitioning, then solves the resulting subarrays recursively.Master theoremNarrower topic: The theorem models the recursive structure used by this algorithmic strategy.Akra–Bazzi methodNarrower topic: The method analyzes the running-time recurrences produced by this strategy.