From ffe134144f275fb44932bf477cef46beae7b095b Mon Sep 17 00:00:00 2001
From: Louis <me@louisgallet.fr>
Date: Fri, 15 Sep 2023 16:01:53 +0200
Subject: [PATCH] vault backup: 2023-09-15 16:01:53

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

diff --git a/Algo/Séminaire/Chapter 5 - Recursivity.md b/Algo/Séminaire/Chapter 5 - Recursivity.md
index e747f75..e30396f 100644
--- a/Algo/Séminaire/Chapter 5 - Recursivity.md	
+++ b/Algo/Séminaire/Chapter 5 - Recursivity.md	
@@ -132,4 +132,5 @@ The best algorithm in term of complexity is the parameter that is constant/linea
 | | |$0(n)$|$O(2^n)$|
 
 
-<img src="https://imgur.com/6OWREOm.png" height=400 width=auto/>
+<center><img src="https://imgur.com/6OWREOm.png" height=400 width=auto/></center>
+This function is not optimize because the number of calls is growing exponentially
\ No newline at end of file