draw the recurrence tree

1 files changed, 19 insertions, 0 deletions

diff --git a/0x01/README.md b/0x01/README.md
index e0a0016..a6ec5cc 100644
--- a/0x01/README.md
+++ b/0x01/README.md
@@ -384,6 +384,25 @@ properties.
 
   `T(n) = 4T(n/2) + cn`
 
+  4T tells me that there are 4 sub problems.
+  The 4 sub problems can be broken down into sub problems and again and again
+  until the sub problems approach a base case.
+
+  ```plaintext
+                            n
+                            |
+                ------------------------------
+              /         /         \          \
+            n/2        n/2         n/2        n/2
+          / /\ \
+        /  /  \  \
+      n/4 n/4 n/4 n/4
+      .
+      .
+      .
+    n/2^i
+  ```
+
   ```plaintext
          lg n
   T(n) = sigma  4i * c(n/2^i)