From f06bbb39d8f071e377e4036baf7a8cd8de30a9f7 Mon Sep 17 00:00:00 2001 From: Louis Date: Thu, 21 Sep 2023 10:04:37 +0200 Subject: [PATCH] vault backup: 2023-09-21 10:04:37 --- .obsidian/workspace.json | 11 ++++++----- Algo/Séminaire/Remediation.md | 37 +++++++++++++++++++++++++++++++++++ 2 files changed, 43 insertions(+), 5 deletions(-) create mode 100644 Algo/Séminaire/Remediation.md diff --git a/.obsidian/workspace.json b/.obsidian/workspace.json index a847511..b9c1ac9 100644 --- a/.obsidian/workspace.json +++ b/.obsidian/workspace.json @@ -13,7 +13,7 @@ "state": { "type": "markdown", "state": { - "file": "Methodologie/Gestion.md", + "file": "Algo/Séminaire/Remediation.md", "mode": "source", "source": false } @@ -97,7 +97,7 @@ "state": { "type": "backlink", "state": { - "file": "Methodologie/Gestion.md", + "file": "Algo/Séminaire/Remediation.md", "collapseAll": false, "extraContext": false, "sortOrder": "alphabetical", @@ -114,7 +114,7 @@ "state": { "type": "outgoing-link", "state": { - "file": "Methodologie/Gestion.md", + "file": "Algo/Séminaire/Remediation.md", "linksCollapsed": false, "unlinkedCollapsed": true } @@ -137,7 +137,7 @@ "state": { "type": "outline", "state": { - "file": "Methodologie/Gestion.md" + "file": "Algo/Séminaire/Remediation.md" } } }, @@ -170,12 +170,13 @@ }, "active": "0d2d422aa24bb900", "lastOpenFiles": [ + "Algo/Séminaire/Exercices seminaire.md", + "Algo/Séminaire/Remediation.md", "Algo/Séminaire/Chapter 5 - Recursivity.md", "Methodologie/Gestion.md", "Methodologie", "Algo/Séminaire/Chapter 4 - A bit of imperative.md", "Algo/Séminaire/Chapter 3 - Case analysis.md", - "Algo/Séminaire/Exercices seminaire.md", "Algo/Séminaire/Introduction.md", "Algo/Séminaire/Chapter 2 - Functions.md", "Algo/Séminaire/Chapter 1 - CAML basics.md", diff --git a/Algo/Séminaire/Remediation.md b/Algo/Séminaire/Remediation.md new file mode 100644 index 0000000..e8ab718 --- /dev/null +++ b/Algo/Séminaire/Remediation.md @@ -0,0 +1,37 @@ +```Ocaml +let rec search n d = + +if n = 0 then + +false + +else if n mod 10 = d then + +true + +else search (n/10) d + + + +let rec chiffre_maximal n = + +  if n < 10 && n > 0 then + +    n + +  else + +    let dernier_chiffre = n mod 10 in + +    let reste = n / 10 in + +    let max_reste = chiffre_maximal reste in + +    if dernier_chiffre > max_reste then + +      dernier_chiffre + +    else + +      max_reste +```