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

vault backup: 2023-10-13 14:16:48

Browse Source
This commit is contained in:
Louis Gallet 2023-10-13 14:16:48 +02:00
parent 0784533b0f
commit 7c1937d8ac
Signed by: lgallet
SSH Key Fingerprint: SHA256:qnW7pk4EoMRR0UftZLZQKSMUImbEFsiruLC7jbCHJAY
2 changed files with 13 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
.obsidian/workspace.json vendored
View File

@ -13,7 +13,7 @@
"state": {
"type": "markdown",
"state": {
"file": "Algo/Séminaire/Chapter 5 - Recursivity.md",
"file": "Algo/Courses/Chapter 6 - Lists (Exercises).md",
"mode": "source",
"source": false
}
@ -97,7 +97,7 @@
"state": {
"type": "backlink",
"state": {
"file": "Algo/Séminaire/Chapter 5 - Recursivity.md",
"file": "Algo/Courses/Chapter 6 - Lists (Exercises).md",
"collapseAll": false,
"extraContext": false,
"sortOrder": "alphabetical",
@ -114,7 +114,7 @@
"state": {
"type": "outgoing-link",
"state": {
"file": "Algo/Séminaire/Chapter 5 - Recursivity.md",
"file": "Algo/Courses/Chapter 6 - Lists (Exercises).md",
"linksCollapsed": false,
"unlinkedCollapsed": true
}
@ -137,7 +137,7 @@
"state": {
"type": "outline",
"state": {
"file": "Algo/Séminaire/Chapter 5 - Recursivity.md"
"file": "Algo/Courses/Chapter 6 - Lists (Exercises).md"
}
}
},
@ -170,11 +170,11 @@
},
"active": "c473a791e2b34194",
"lastOpenFiles": [
"Algo/Courses/Chapter 6 - Lists.md",
"Algo/Séminaire/Chapter 5 - Recursivity.md",
"Algo/Séminaire/Chapter 4 - A bit of imperative.md",
"Algo/Séminaire/Chapter 3 - Case analysis.md",
"Prog/Loops.md",
"Algo/Courses/Chapter 6 - Lists.md",
"Algo/Séminaire/Chapter 5 - Recursivity.md",
"Algo/CM/Lists.md",
"Algo/CM/CM du 27 septembre.md",
"Algo/CM/CM du 04 octobre.md",

7
Algo/Courses/Chapter 6 - Lists (Exercises).md
View File

@ -137,6 +137,13 @@ let concatenate_lists lst1 lst2 =
let rec growing = function
| [] | [_] -> true
| x :: y :: rest -> if x <= y then growing (y :: rest) else false;;
let growing = function
|[] -> true
|l -> let rec g = function
|[e]-> true
| e1::e2::t -> if e1 > e2 then false else g(e2::t)
in g l;;
```
## Exercise 3.2