Please enable JavaScript.
Coggle requires JavaScript to display documents.
Greedy Technique, Dynamic Programming, The Knacksack problem
and Memory…
Greedy Technique
The greedy approach suggests constructing a solution through a sequence of steps, each expanding a partially constructed solution obtained so far, until a complete solution to the problem is reached.
Feasible, locally optimal, irrevocable
-
As a rule, greedy algorithms are both intuitively appealing and simple.
Dynamic Programming
overlapping
subproblems
Rather than solving overlapping subproblems again and again, dynamic programming suggests solving each of the smaller subproblems only once and recording the results in a table from which a solution to the original problem can then be obtained.
-
-
-
-
-