File:Merge_sort_algorithm_diagram.svg · Wikimedia Commons · See Wikimedia Commons
divide-and-conquer algorithm
Sign in to saveAlso known as divide-and-conquer method, divide and conquer algorithm, divide and conquer
algorithm design paradigm based on multi-branched recursion
Wikidata facts
Show 1 more fact
- Commons category
- Divide-and-conquer algorithms
Sources (2)
via Wikidata · CC0
~16 min read
Article
In computer science, divide and conquer is an algorithm design paradigm. A divide-and-conquer algorithm recursively breaks down a problem into two or more sub-problems of the same or related type, until these become simple enough to be solved directly. The solutions to the sub-problems are then combined to give a solution to the original problem.
The divide-and-conquer technique is the basis of efficient algorithms for many problems, such as sorting (e.g., quicksort, merge sort), multiplying large numbers (e.g., the Karatsuba algorithm), finding the closest pair of points, syntactic analysis (e.g., top-down parsers), SAT solving, and computing the discrete Fourier transform (FFT).