# Answer to Question #52156 in Other Programming & Computer Science for irebami

Question #52156
The following are advantges of Divide-and Conquer, except? Solving difficult problems Memory access Algorithm efficiency None of the options is correct
d. None of the options is correct
a,b,c are advantages of Divide-and Conquer
Solving difficult problems
Divide and conquer is a powerful tool for solving conceptually difficult problems: all it requires is a way of breaking the problem into sub-problems, of solving the trivial cases and of combining sub-problems to the original problem. Similarly, decrease and conquer only requires reducing the problem to a single smaller problem, such as the classic Tower of Hanoi puzzle, which reduces moving a tower of height n to moving a tower of height n &minus; 1.
Algorithm efficiency
The divide-and-conquer paradigm often helps in the discovery of efficient algorithms. It was the key, for example, to Karatsuba&#039;s fast multiplication method, the quicksort and mergesort algorithms, the Strassen algorithm for matrix multiplication, and fast Fourier transforms.
In all these examples, the D&amp;C approach led to an improvement in the asymptotic cost of the solution.
Memory access
Divide-and-conquer algorithms naturally tend to make efficient use of memory caches. The reason is that once a sub-problem is small enough, it and all its sub-problems can, in principle, be solved within the cache, without accessing the slower main memory. An algorithm designed to exploit the cache in this way is called cache-oblivious, because it does not contain the cache size(s) as an explicit parameter. Moreover, D&amp;C algorithms can be designed for important algorithms (e.g., sorting, FFTs, and matrix multiplication) to beoptimal cache-oblivious algorithms&ndash;they use the cache in a probably optimal way, in an asymptotic sense, regardless of the cache size. In contrast, the traditional approach to exploiting the cache is blocking, as in loop nest optimization, where the problem is explicitly divided into chunks of the appropriate size&mdash;this can also use the cache optimally, but only when the algorithm is tuned for the specific cache size(s) of a particular machine.

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!