①
public class Demo{
public static void main(String[] args) {
System.out.println(fibonacci(100));
}
public static int fibonacci(int n) {
if (n == 1 || n == 2) {
return 1;
} else {
return fibonacci(n - 1) + fibonacci(n - 2);
}
}
}
②
public class Demo{
public static void main(String[] args) {
for (int counter = 0; counter <= 30; counter++) {
System.out.printf("Fibonacci of %d\t is: %d\n", counter, fibonacci(counter));
}
}
public static long fibonacci(long number) {
if ((number == 0) || (number == 1))
return number;
else
return fibonacci(number - 1) + fibonacci(number - 2);
}
}