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

---
 .obsidian/workspace.json                  | 10 +++++-----
 Algo/Séminaire/Chapter 5 - Recursivity.md |  1 +
 2 files changed, 6 insertions(+), 5 deletions(-)

diff --git a/.obsidian/workspace.json b/.obsidian/workspace.json
index 43c79c4..03e1625 100644
--- a/.obsidian/workspace.json
+++ b/.obsidian/workspace.json
@@ -13,7 +13,7 @@
             "state": {
               "type": "markdown",
               "state": {
-                "file": "Algo/Séminaire/Exercices seminaire.md",
+                "file": "Algo/Séminaire/Chapter 5 - Recursivity.md",
                 "mode": "source",
                 "source": false
               }
@@ -97,7 +97,7 @@
             "state": {
               "type": "backlink",
               "state": {
-                "file": "Algo/Séminaire/Exercices seminaire.md",
+                "file": "Algo/Séminaire/Chapter 5 - Recursivity.md",
                 "collapseAll": false,
                 "extraContext": false,
                 "sortOrder": "alphabetical",
@@ -114,7 +114,7 @@
             "state": {
               "type": "outgoing-link",
               "state": {
-                "file": "Algo/Séminaire/Exercices seminaire.md",
+                "file": "Algo/Séminaire/Chapter 5 - Recursivity.md",
                 "linksCollapsed": false,
                 "unlinkedCollapsed": true
               }
@@ -137,7 +137,7 @@
             "state": {
               "type": "outline",
               "state": {
-                "file": "Algo/Séminaire/Exercices seminaire.md"
+                "file": "Algo/Séminaire/Chapter 5 - Recursivity.md"
               }
             }
           },
@@ -170,8 +170,8 @@
   },
   "active": "0d2d422aa24bb900",
   "lastOpenFiles": [
-    "Algo/Séminaire/Chapter 5 - Recursivity.md",
     "Algo/Séminaire/Exercices seminaire.md",
+    "Algo/Séminaire/Chapter 5 - Recursivity.md",
     "Algo/Séminaire/Introduction.md",
     "Algo/Séminaire/Chapter 3 - Case analysis.md",
     "Algo/Séminaire/Chapter 2 - Functions.md",
diff --git a/Algo/Séminaire/Chapter 5 - Recursivity.md b/Algo/Séminaire/Chapter 5 - Recursivity.md
index 56db4f9..f41bffe 100644
--- a/Algo/Séminaire/Chapter 5 - Recursivity.md	
+++ b/Algo/Séminaire/Chapter 5 - Recursivity.md	
@@ -139,6 +139,7 @@ The best algorithm in term of complexity is the parameter that is constant/linea
 
 
 <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. 
 A good function will be:
 ```Ocaml