vault backup: 2023-09-14 16:02:59

Algo/Séminaire/Chapter 5 - Recursivity.md

@@ -61,4 +61,6 @@ flowchart LR
 
 A[ctd 3] --> B[ctd 2] --> C[ctd 1] --> D[ctd 0] --> E[ctd -1] --> F[ ] --> E --> D --> C --> B --> A
 ```
-> ctd is countdown
+> ctd is countdown
+
+## 5.3. Several recursive calls

Algo/Séminaire/Exercices seminaire.md

@@ -269,6 +269,14 @@ A[seq 3] --> B[4*seq2-1] --> C[4*seq1-1] --> D[4*seq0-1] --> E[1] --> F[4*1-1] -
 	| 0 -> u0
 	|n -> q*geo(n-1) in geo n;;
 ```
+## Exercise 4.4
+```Ocaml
+# let rec gcd a b = 
+	if a mod b = 0 then
+		b
+	else
+		gcd b (a mod b);;
+```
 ## Exercise 4.5
 ```Ocaml
 let rec add a = function