From 90ef21f8be1814821a3b19e78bc9afbd5f84f71a Mon Sep 17 00:00:00 2001
From: bt3gl <138340846+cypher-bt3gl@users.noreply.github.com>
Date: Sat, 29 Jul 2023 21:03:50 -0700
Subject: [PATCH] Update README.md

---
 math_logic_dp/README.md | 17 +++++++++++++++++
 1 file changed, 17 insertions(+)

diff --git a/math_logic_dp/README.md b/math_logic_dp/README.md
index fe314fa..0f841ff 100644
--- a/math_logic_dp/README.md
+++ b/math_logic_dp/README.md
@@ -2,6 +2,23 @@
 
 <br>
 
+### dynamic programming
+
+<br>
+
+* take a recursive algorithm and cache overlapping problems (repeated calls).
+* the runtime is given by the number of calls.
+* **top-down**: how can we divide the problem into sub-problems?
+    * top-down dynamic programming is called **memoization**.
+* **bottom-up**: solve for a simple case, then figure out for more elements.
+
+<br>
+
+---
+
+### examples
+
+<br>
 
 ```python
 python3 fibonacci.py