33 lines
667 B
Java
33 lines
667 B
Java
|
// functional/RecursiveFibonacci.java
|
|||
|
|
// <20>2016 MindView LLC: see Copyright.txt
|
|||
|
|
// We make no guarantees that this code is fit for any purpose.
|
|||
|
|
// Visit http://mindviewinc.com/Books/OnJava/ for more book information.
|
|||
|
|
|
|||
|
|
public class RecursiveFibonacci {
|
|||
|
|
IntCall fib;
|
|||
|
|
RecursiveFibonacci() {
|
|||
|
|
fib = n -> n == 0 ? 0 :
|
|||
|
|
n == 1 ? 1 :
|
|||
|
|
fib.call(n - 1) + fib.call(n - 2);
|
|||
|
|
}
|
|||
|
|
int fibonacci(int n) { return fib.call(n); }
|
|||
|
|
public static void main(String[] args) {
|
|||
|
|
RecursiveFibonacci rf = new RecursiveFibonacci();
|
|||
|
|
for(int i = 0; i <= 10; i++)
|
|||
|
|
System.out.println(rf.fibonacci(i));
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
/* Output:
|
|||
|
|
0
|
|||
|
|
1
|
|||
|
|
1
|
|||
|
|
2
|
|||
|
|
3
|
|||
|
|
5
|
|||
|
|
8
|
|||
|
|
13
|
|||
|
|
21
|
|||
|
|
34
|
|||
|
|
55
|
|||
|
|
*/
|