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

vault backup: 2023-10-06 14:52:29

Browse Source
This commit is contained in:
Louis Gallet 2023-10-06 14:52:29 +02:00
parent 890ea1b07b
commit aa40e475bc
Signed by: lgallet
SSH Key Fingerprint: SHA256:qnW7pk4EoMRR0UftZLZQKSMUImbEFsiruLC7jbCHJAY
1 changed files with 14 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -54,7 +54,7 @@ val search 'a -> 'a list -> bool = <fun>
| (_::t, n) -> nthrec(t, n-1) | (_::t, n) -> nthrec(t, n-1)
in in
ntrec(l, n);; ntrec(l, n);;
val nth 'a list -> 'a -> int = <fun> val nth 'a list -> int -> 'a = <fun>
``` ```
@ -66,6 +66,18 @@ val nth 'a list -> 'a -> int = <fun>
| hd :: tl -> | hd :: tl ->
let max_tail = max_value tl in let max_tail = max_value tl in
if hd > max_tail then hd else max_tail;; if hd > max_tail then hd else max_tail;;
(* v2 *)
# let max_value list =
if list = [] then
failwith "la list est vide"
else
let rec mv = match list with
| [x] -> x
| hd :: tl ->
let max_tail = max_value tl in
if hd > max_tail then hd else max_tail
in mv list;;
``` ```
## 1.6 - Bonus second ## 1.6 - Bonus second
@ -90,7 +102,7 @@ val nth 'a list -> 'a -> int = <fun>
``` ```
## Exercise 2.1 ## Exercise 2.1
```Ocaml ```
let rec arith_list n a r = let rec arith_list n a r =