From 9620f6f61116f41e5de135cbd54d0ed4085e9a86 Mon Sep 17 00:00:00 2001 From: Tyler Perkins Date: Sat, 26 Feb 2022 22:30:01 -0500 Subject: [PATCH] Update for 26-02-22 22:30 --- tech/dynamic_programming.wiki | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 tech/dynamic_programming.wiki diff --git a/tech/dynamic_programming.wiki b/tech/dynamic_programming.wiki new file mode 100644 index 0000000..b408430 --- /dev/null +++ b/tech/dynamic_programming.wiki @@ -0,0 +1,18 @@ += Dynamic Programming = + +Dynamic Programming is a paradigm where we systematically and efficeiently +explore all possible solutions to a problem. Generally, problems suited to DP +have the following properties + +1) Problem can be broken down into overlaping subproblems +2) An optimal solution can be formed from optimal solutions to the overlapping + subproblems derrived from the original problem. + +There are two ways to implement a DP algo + +== Implimentation == + +=== Bottom up (Tabulation) === + +For tabulation we start at the lowest sub problem and work our way up to the +desired solution.