Divide and conquer partition a problem into independent

Solution

Divide & Conqure Dynamic Programming Partition a problem into independent smaller sub problems Partition a problem into overlapping smaller sub problems Doesnt store solution of sub-problems.(identical sub-problems may arisse-results in the same computations are performed repeatedly.) stores solution of sub-problems : thus avoids calculations of same quantity twice Top down alogithms : which logically progresses from the initial instance down to the smallest sub- instances. Bottom up algorithms : in which the smallest sub-problems are explicity solved first and the results of the used to construct solutions to progressively larger sub-instances.