What is the divide and conquer paradigm of problem solving. explain withexample?
Answers
Answered by
0
In computer science, divide and conquer is an algorithm design paradigm based on multi-branched recursion. A divude and conquer algorithm works by recursively breaking down a problem into two or more subproblems of the same or related type, until these become simple enough to be solve directly.
An early example of a divide-and-conquer algorithm with multiple subproblems is Gauss's 1805 description of what is now called the Cooley-Tukey fast fourier transform (FFT) algorithm,although he did not analyse its operation count quantitatively and FFTs did not become widespread until they were rediscovered over a century later.
An early example of a divide-and-conquer algorithm with multiple subproblems is Gauss's 1805 description of what is now called the Cooley-Tukey fast fourier transform (FFT) algorithm,although he did not analyse its operation count quantitatively and FFTs did not become widespread until they were rediscovered over a century later.
Similar questions