vault backup: 2023-09-15 14:39:17

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

@@ -94,3 +94,11 @@ val add : int -> bool = <fun>
 val even : int -> bool = <fun>
 ```
 
+An accumulator is a thing that try to get our result. In CAML we trying to not use an accumulator in our program. In CAML the syntax for the accumulator (`inv`) is: (exemple with reverse_int exercise. See 4.9 - b)
+```Ocaml
+# let reverse_int =
+	let rec rev inv = function
+		| 0 -> inv
+		| n -> rev (inv*10 + n mod 10)(n/10)
+	in rev 0 n;;
+```

Algo/Séminaire/Exercices seminaire.md

@@ -339,12 +339,10 @@ let rec reverse_int n =
 val reverse : int -> string = <fun>
 
 # let reverse_int =
-	let rec rev org new_ =
-		if org < 10 then
-			new_ * 10 + org
-		else
-			rev (org/10)(new*10 + org mod 10)
-	in rev n 0;;
+	let rec rev inv = function
+		| 0 -> inv
+		| n -> rev (inv*10 + n mod 10)(n/10)
+	in rev 0 n;;
 ```
 
 ## Exercise 4.10