Question

Difference between divide and conquer and dynamic programming in tabular form

Answer 1

A divide and conquer algorithm works by continuously breaking down a problem into two or more sub-problems of the same  type, until these problems become simple enough and could be solved easily on the other hand Dynamic Programming can be defined as a method for solving a complex problem by breaking it down into a collection of simpler sub problems then solving each of these sub problems just once, and then storing their solutions using a memory-based data structure

hence difference between divide and conquer and dynamic programming in tabular form is that in dynamic programming sub problems formed from main problem can be shown using tables.

Answer 2

Divide and conquer is similar to dynamic programming if it comes to dividing a large problem.

They are divided into some sub-problems and each of such sub-problems in solved only once.

There is no recursion, and remembering process is the key feature of dynamic programming.

Matrix chain multiplication, tower of Hanoi puzzle is some of the program which is solved by dynamic programming.