Exercice 8 : Factorielle et recursivité

qualdev/TD-Debug.ts

@@ -123,12 +123,34 @@ function multiplicationParAddition(x: number, y: number): number {
   }
   
 
-  let couples = [
-    [0, 0], [5, 3], [3, 5], [-5, -2], [-2, -5],
-    [-74, 2], [-1, 75], [10, -25], [10, -3]
-  ];
+//let couples = [
+//    [0, 0], [5, 3], [3, 5], [-5, -2], [-2, -5],
+//    [-74, 2], [-1, 75], [10, -25], [10, -3]
+//];
   
-  for (let [x, y] of couples) {
-    console.log(`multiplicationParAddition(${x}, ${y}) = ${multiplicationParAddition(x, y)}`);
+//for (let [x, y] of couples) {
+//    console.log(`multiplicationParAddition(${x}, ${y}) = ${multiplicationParAddition(x, y)}`);
+//}
+
+
+//exo 8 : 
+
+
+let n = 5;
+console.log(factorielle(n));
+
+function factorielle(n: number): number {
+  if (n === 0) {
+    return 1;
   }
-  
+  let valeur = n * factorielle(n - 1);
\ No newline at end of file
+  return valeur;
+}
+
+
+function factorielle2(n: number): number {
+    if (n < 0) throw new Error("Valeur non valide pour la factorielle");
+    if (n === 0) return 1;
+    return n * factorielle2(n - 1);
+}
+