Content deleted Content added
Taumata994 (talk | contribs) Importing Wikidata short description: "Algorithm design paradigm based on multi-branched recursion" (Shortdesc helper) |
The expression "multi-branched recursion" is not standard, and doesn't add anything |
||
Line 1:
{{short description|Algorithm design paradigm based on multi-branched recursion}}
In [[computer science]], '''divide and conquer''' is an [[algorithm design paradigm
This divide-and-conquer technique is the basis of efficient algorithms for all kinds of problems, such as [[sorting algorithm|sorting]] (e.g., [[quicksort]], [[merge sort]]), [[multiplication algorithm|multiplying large numbers]] (e.g. the [[Karatsuba algorithm]]), finding the [[Closest pair of points problem|closest pair of points]], [[syntactic analysis]] (e.g., [[top-down parser]]s), and computing the [[discrete Fourier transform]] ([[fast Fourier transform|FFT]]).<ref>{{cite book |last1=Blahut |first1=Richard |title=Fast Algorithms for Signal Processing |publisher=Cambridge University Press |isbn=978-0-511-77637-3 |pages=139–143}}</ref>
|