lgallet/epicours
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

vault backup: 2023-09-12 17:15:21

Browse Source
This commit is contained in:
Louis Gallet 2023-09-12 17:15:21 +02:00
parent 75bdb42cd6
commit 91ea71795f
Signed by: lgallet
SSH Key Fingerprint: SHA256:qnW7pk4EoMRR0UftZLZQKSMUImbEFsiruLC7jbCHJAY
2 changed files with 18 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
.obsidian/workspace.json vendored
View File

@ -171,6 +171,8 @@
"active": "c82ce15f72f65a11", "active": "c82ce15f72f65a11",
"lastOpenFiles": [ "lastOpenFiles": [
"Algo/Séminaire/Chapter 5 - Recursivity.md", "Algo/Séminaire/Chapter 5 - Recursivity.md",
"Algo/Séminaire/Chapter 3 - Case analysis.md",
"Algo/Séminaire/Chapter 2 - Functions.md",
"Algo/Séminaire/Exercices seminaire.md", "Algo/Séminaire/Exercices seminaire.md",
"Algo/Séminaire/assets/fact function response.png", "Algo/Séminaire/assets/fact function response.png",
"Algo/Séminaire/assets/recursivite-meme.png", "Algo/Séminaire/assets/recursivite-meme.png",
@ -180,10 +182,8 @@
"Algo/Séminaire/Untitled", "Algo/Séminaire/Untitled",
"Algo/Séminaire/Introduction.md", "Algo/Séminaire/Introduction.md",
"Algo/Séminaire/Chapter 1 - CAML basics.md", "Algo/Séminaire/Chapter 1 - CAML basics.md",
"Algo/Séminaire/Chapter 2 - Functions.md",
"Mathématiques/Séminaire/Logics/Logics.md", "Mathématiques/Séminaire/Logics/Logics.md",
"Algo/Chapter 0 - A bit of imperative", "Algo/Chapter 0 - A bit of imperative",
"Algo/Séminaire/Chapter 3 - Case analysis.md",
"README.md", "README.md",
"Algo/Séminaire/Weird stuff.md", "Algo/Séminaire/Weird stuff.md",
"Algo/Séminaire/assets/69E2987C-209A-48CD-8964-5A60462966E5.jpg", "Algo/Séminaire/assets/69E2987C-209A-48CD-8964-5A60462966E5.jpg",

24
Algo/Séminaire/Exercices seminaire.md
View File

@ -250,13 +250,21 @@ let time_difference (d1, md1, sd1, pos1) (d2, md2, sd2, pos2)
## Exercise 4.2 ## Exercise 4.2
```Ocaml ```Ocaml
let rec suite n = let a = 0 in
if n <= 0 then
a
else
a + suite (4*(n-1) - 1);;
let rec sequence = function let rec sequence = function
| 0 -> 1 | 0 -> 1
| n -> 4* sequence(n-1) - 1;; | n -> 4* sequence(n-1) - 1;;
val sequence : int -> int = <fun>
```
```mermaid
flowchart LR
A[seq 3] --> B[4*seq2-1] --> C[4*seq1-1] --> D[4*seq0-1] --> E[1] --> F[4*1-1] --> G[4*3-1] --> H[4*11-1]
```
## Exercise 4.5
```Ocaml
let rec add a = function
| 0 -> a
| b -> 1 + add a (b-1);;
```