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

vault backup: 2023-09-15 17:44:01

Browse Source
This commit is contained in:
Louis Gallet 2023-09-15 17:44:01 +02:00
parent 8e290a1e04
commit 00af0e8a7f
Signed by: lgallet
SSH Key Fingerprint: SHA256:qnW7pk4EoMRR0UftZLZQKSMUImbEFsiruLC7jbCHJAY
2 changed files with 6 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
.obsidian/workspace.json vendored
View File

@ -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",

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

@ -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