DEV3.2 TP'S

DEV/DEV3.2/TP02/Exercise1/Recursion.java

@@ -0,0 +1,27 @@
+public class Recursion {
+    
+    public static void main(String[] args) {
+        if(args.length > 0) {
+            displayFactorial(Integer.parseInt(args[0]));
+            return; 
+        }
+
+        System.out.println("Usage: java Recursion <number>");
+    }
+
+    public static void displayFactorial(int n) {
+        System.out.println(n + "! = " + factorial(n, 0));
+    }
+
+    private static int factorial(int n, int count) {
+        count++;
+        System.out.println("n = " + n + " | count = " + count);
+
+        if(n == 0) {
+            //Thread.dumpStack();
+            return 1; 
+        }
+
+        return n * factorial(n - 1, count);
+    }
+}

DEV/DEV3.2/TP02/Exercise1/answer.txt

@@ -0,0 +1,14 @@
+Avec utilisation de dumpStack() : 
+On test pour factoriel de 3, on y voit bien 4 appels : 
+- 3 qui appellent le cas réussit 
+- 1 qui appelle le cas de base 
+
+nathanpasdutout@Macbook-Air-Nathan Exercise1 % java Recursion 3    
+java.lang.Exception: Stack trace
+        at java.base/java.lang.Thread.dumpStack(Thread.java:2209)
+        at Recursion.factorial(Recursion.java:18)
+        at Recursion.factorial(Recursion.java:22)
+        at Recursion.factorial(Recursion.java:22)
+        at Recursion.factorial(Recursion.java:22)
+        at Recursion.displayFactorial(Recursion.java:13)
+        at Recursion.main(Recursion.java:5)