From 9f6aa09c01893f65bd3eb3025098e09d6e7cc276 Mon Sep 17 00:00:00 2001
From: Louis <me@louisgallet.fr>
Date: Fri, 15 Sep 2023 15:58:08 +0200
Subject: [PATCH] vault backup: 2023-09-15 15:58:08

---
 Algo/Séminaire/Chapter 5 - Recursivity.md | 8 ++++++--
 1 file changed, 6 insertions(+), 2 deletions(-)

diff --git a/Algo/Séminaire/Chapter 5 - Recursivity.md b/Algo/Séminaire/Chapter 5 - Recursivity.md
index b4464f8..e747f75 100644
--- a/Algo/Séminaire/Chapter 5 - Recursivity.md	
+++ b/Algo/Séminaire/Chapter 5 - Recursivity.md	
@@ -126,6 +126,10 @@ The best algorithm in term of complexity is the parameter that is constant/linea
 |1|1|def|1 call|
 |2|2|+|3 calls|
 |3|3|+|5 calls|
-|4|5|+|8 calls|
-|5|8|+|11 calls|
+|4|5|+|9 calls|
+|5|8|+|15 calls|
 |6|13|+|14 calls|
+| | |$0(n)$|$O(2^n)$|
+
+
+<img src="https://imgur.com/6OWREOm.png" height=400 width=auto/>