24 lines
615 B
Java
24 lines
615 B
Java
|
public class Fibonacci {
|
||
|
|
public static int fib(int n) {
|
||
|
|
if (n <= 1) {
|
||
|
|
return n;
|
||
|
|
}
|
||
|
|
return fib(n - 1) + fib(n - 2);
|
||
|
|
}
|
||
|
|
|
||
|
|
public static int main() {
|
||
|
|
System.out.println(fib(0));
|
||
|
|
System.out.println(fib(1));
|
||
|
|
System.out.println(fib(2));
|
||
|
|
System.out.println(fib(3));
|
||
|
|
System.out.println(fib(4));
|
||
|
|
System.out.println(fib(5));
|
||
|
|
System.out.println(fib(6));
|
||
|
|
System.out.println(fib(7));
|
||
|
|
System.out.println(fib(8));
|
||
|
|
System.out.println(fib(9));
|
||
|
|
System.out.println(fib(10));
|
||
|
|
return 0;
|
||
|
|
}
|
||
|
|
}
|