tp recursivite
This commit is contained in:
BIN
DEV3.2/TP02/03_Fibonacci/Fibonacci.class
Normal file
BIN
DEV3.2/TP02/03_Fibonacci/Fibonacci.class
Normal file
Binary file not shown.
27
DEV3.2/TP02/03_Fibonacci/Fibonacci.java
Normal file
27
DEV3.2/TP02/03_Fibonacci/Fibonacci.java
Normal file
@@ -0,0 +1,27 @@
|
||||
public class Fibonacci {
|
||||
|
||||
public static int fibonacci(int n, int indentation) {
|
||||
for (int i = 0; i != indentation; i++) {
|
||||
System.out.print(" ");
|
||||
}
|
||||
System.out.println("Valeur de n : " + n);
|
||||
if (n == 0) {
|
||||
for (int i = 0; i != indentation; i++) {
|
||||
System.out.print(" ");
|
||||
}
|
||||
System.out.println("Valeur de retour : " + 0);
|
||||
return 0;
|
||||
} if (n == 1) {
|
||||
for (int i = 0; i != indentation; i++) {
|
||||
System.out.print(" ");
|
||||
}
|
||||
System.out.println("Valeur de retour : " + 1);
|
||||
return 1;
|
||||
}
|
||||
for (int i = 0; i != indentation; i++) {
|
||||
System.out.print(" ");
|
||||
}
|
||||
System.out.println("Valeur de retour : " + fibonacci(n-2, ++indentation) + fibonacci(n-1, ++indentation));
|
||||
return fibonacci(n-2, ++indentation) + fibonacci(n-1, ++indentation);
|
||||
}
|
||||
}
|
BIN
DEV3.2/TP02/03_Fibonacci/Main.class
Normal file
BIN
DEV3.2/TP02/03_Fibonacci/Main.class
Normal file
Binary file not shown.
5
DEV3.2/TP02/03_Fibonacci/Main.java
Normal file
5
DEV3.2/TP02/03_Fibonacci/Main.java
Normal file
@@ -0,0 +1,5 @@
|
||||
public class Main {
|
||||
public static void main(String[] args) {
|
||||
System.out.println(Fibonacci.fibonacci(Integer.parseInt(args[0]), 0));
|
||||
}
|
||||
}
|
Reference in New Issue
Block a user