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