🃏
Dynamic programming
course Algorithmics
last review @April 14, 2023
mastery rookie
assignment
progress not started
Weight
Files
date
due date
notes
days left
Dynamic Programming
Introduction
Dynamic Programming is a problem-solving technique used in computer science to
break down complex problems into smaller, more manageable sub-problems. These
sub-problems are then solved individually, and their solutions are combined to solve
the original problem.
How It Works
Dynamic Programming works by solving sub-problems and storing their solutions in
a table to avoid re-calculating them. The answers to the sub-problems are used to
solve the original problem.
For example, imagine you have a big jigsaw puzzle. You can't put all the pieces
together at once, so you start by finding the edge pieces and putting them together.
Dynamic programming 1
Dynamic programming
course Algorithmics
last review @April 14, 2023
mastery rookie
assignment
progress not started
Weight
Files
date
due date
notes
days left
Dynamic Programming
Introduction
Dynamic Programming is a problem-solving technique used in computer science to
break down complex problems into smaller, more manageable sub-problems. These
sub-problems are then solved individually, and their solutions are combined to solve
the original problem.
How It Works
Dynamic Programming works by solving sub-problems and storing their solutions in
a table to avoid re-calculating them. The answers to the sub-problems are used to
solve the original problem.
For example, imagine you have a big jigsaw puzzle. You can't put all the pieces
together at once, so you start by finding the edge pieces and putting them together.
Dynamic programming 1
