39 lines
1.2 KiB
Java
39 lines
1.2 KiB
Java
/*
|
|
* Author: Oliver Ilczuk
|
|
* Fach : Programmieren
|
|
* fibonacci_iterativ laeuft viel schneller, da die Werte direkt in Variablen gespeichert
|
|
* und nicht rekursiv im Stack abgelaufen werden.
|
|
*/
|
|
|
|
public class Aufgabe1 {
|
|
public static void main(String[] args){
|
|
fibonacci_iterativ(45);
|
|
System.out.println("----////////////----");
|
|
init_fib_rec(45);
|
|
}
|
|
public static void fibonacci_iterativ(int fib){
|
|
int buffErg1 = 0;
|
|
int buffErg2 = 1;
|
|
System.out.println(buffErg1 + ", ");
|
|
System.out.println(buffErg2 + ", ");
|
|
for(int i=1; i<fib; i++){
|
|
int ErgNext = buffErg1 + buffErg2;
|
|
buffErg1 = buffErg2;
|
|
buffErg2 = ErgNext;
|
|
|
|
System.out.println(ErgNext + ", ");
|
|
}
|
|
}
|
|
public static void init_fib_rec(int fib){
|
|
for (int i = 0; i <= fib; ++i) {
|
|
System.out.println("i: " + i + " = " + fibonacci_recursive(i) + ", ");
|
|
}
|
|
}
|
|
public static int fibonacci_recursive(int fib){
|
|
if (fib <= 1) {
|
|
return fib;
|
|
} else {
|
|
return fibonacci_recursive(fib - 1) + fibonacci_recursive(fib - 2);
|
|
}
|
|
}
|
|
} |