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

vault backup: 2023-10-19 21:39:11

Browse Source
This commit is contained in:
Louis Gallet 2023-10-19 21:39:11 +02:00
parent 655b4664bb
commit 3244da3342
Signed by: lgallet
SSH Key Fingerprint: SHA256:qnW7pk4EoMRR0UftZLZQKSMUImbEFsiruLC7jbCHJAY
2 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
.obsidian/workspace.json vendored
View File

@ -25,7 +25,7 @@
"state": { "state": {
"type": "markdown", "type": "markdown",
"state": { "state": {
"file": "Algo/Courses/Chapter 6 - Lists.md", "file": "Algo/Séminaire/Chapter 5 - Recursivity.md",
"mode": "source", "mode": "source",
"source": false "source": false
} }
@ -98,7 +98,7 @@
"state": { "state": {
"type": "backlink", "type": "backlink",
"state": { "state": {
"file": "Algo/Courses/Chapter 6 - Lists.md", "file": "Algo/Séminaire/Chapter 5 - Recursivity.md",
"collapseAll": false, "collapseAll": false,
"extraContext": false, "extraContext": false,
"sortOrder": "alphabetical", "sortOrder": "alphabetical",
@ -115,7 +115,7 @@
"state": { "state": {
"type": "outgoing-link", "type": "outgoing-link",
"state": { "state": {
"file": "Algo/Courses/Chapter 6 - Lists.md", "file": "Algo/Séminaire/Chapter 5 - Recursivity.md",
"linksCollapsed": false, "linksCollapsed": false,
"unlinkedCollapsed": true "unlinkedCollapsed": true
} }
@ -138,7 +138,7 @@
"state": { "state": {
"type": "outline", "type": "outline",
"state": { "state": {
"file": "Algo/Courses/Chapter 6 - Lists.md" "file": "Algo/Séminaire/Chapter 5 - Recursivity.md"
} }
} }
}, },
@ -171,9 +171,9 @@
}, },
"active": "26919eaeae9a8f38", "active": "26919eaeae9a8f38",
"lastOpenFiles": [ "lastOpenFiles": [
"Algo/Courses/Chapter 6 - Lists.md",
"Algo/Séminaire/Chapter 3 - Case analysis.md", "Algo/Séminaire/Chapter 3 - Case analysis.md",
"Algo/Séminaire/Chapter 2 - Functions.md", "Algo/Séminaire/Chapter 2 - Functions.md",
"Algo/Courses/Chapter 6 - Lists.md",
"Algo/Courses/Chapter 6 - Lists (Exercises).md", "Algo/Courses/Chapter 6 - Lists (Exercises).md",
"Algo/Séminaire/Chapter 1 - CAML basics.md", "Algo/Séminaire/Chapter 1 - CAML basics.md",
"Prog/Loops.md", "Prog/Loops.md",

2
Algo/Séminaire/Chapter 5 - Recursivity.md
View File

@ -65,7 +65,7 @@ A[ctd 3] --> B[ctd 2] --> C[ctd 1] --> D[ctd 0] --> E[ctd -1] --> F[ ] --> E -->
> ctd is countdown > ctd is countdown
## 5.3. Several recursive calls ## 5.3. Several recursive calls
A function that have several recursive calls is defind like this A function that have several recursive calls is defined like this
$$ $$
Fn = {1 -> \text{if } n\eqslantless{1} \brace{Fn+1+Fn+2} } Fn = {1 -> \text{if } n\eqslantless{1} \brace{Fn+1+Fn+2} }
$$ $$