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

vault backup: 2023-10-13 14:58:36

Browse Source
This commit is contained in:
Louis Gallet 2023-10-13 14:58:36 +02:00
parent e29bce3e13
commit b79c8ba9a0
Signed by: lgallet
SSH Key Fingerprint: SHA256:qnW7pk4EoMRR0UftZLZQKSMUImbEFsiruLC7jbCHJAY
2 changed files with 18 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
.obsidian/workspace.json vendored
View File

@ -31,8 +31,7 @@
} }
} }
} }
], ]
"currentTab": 1
} }
], ],
"direction": "vertical" "direction": "vertical"
@ -169,10 +168,11 @@
"command-palette:Open command palette": false "command-palette:Open command palette": false
} }
}, },
"active": "c473a791e2b34194", "active": "eaf65669cfff2a2c",
"lastOpenFiles": [ "lastOpenFiles": [
"Prog/Loops.md", "Algo/Séminaire/Chapter 1 - CAML basics.md",
"Algo/Courses/Chapter 6 - Lists (Exercises).md", "Algo/Courses/Chapter 6 - Lists (Exercises).md",
"Prog/Loops.md",
"Algo/Courses/Chapter 6 - Lists.md", "Algo/Courses/Chapter 6 - Lists.md",
"Algo/Séminaire/Chapter 5 - Recursivity.md", "Algo/Séminaire/Chapter 5 - Recursivity.md",
"Algo/Séminaire/Chapter 4 - A bit of imperative.md", "Algo/Séminaire/Chapter 4 - A bit of imperative.md",
@ -201,7 +201,6 @@
"COM-ADMR", "COM-ADMR",
"Methodologie", "Methodologie",
"Algo/Séminaire/Introduction.md", "Algo/Séminaire/Introduction.md",
"Algo/Séminaire/Chapter 1 - CAML basics.md",
"Algo/Séminaire/assets/exception-meme.png", "Algo/Séminaire/assets/exception-meme.png",
"Algo/Séminaire/assets/filter-meme.png", "Algo/Séminaire/assets/filter-meme.png",
"Algo/Séminaire/assets/if-meme.png", "Algo/Séminaire/assets/if-meme.png",

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

@ -184,3 +184,17 @@ val delete: int -> 'a list -> list = <fun>
failwith "Out of bound" failwith "Out of bound"
else else
(* Correction *)
let insert_nth w i list =
if i <= 0 then
invalid_arg "negative rank"
else
let rec insrec i = function
[] -> if i > 1 then
failwith "out of bound"
else
x::t
| e::E when i = 1 -> x::e::t
| e::t -> e::insrec (i - 1) t
in insrec i list;;