OnJava8-Examples/functional/RecursiveFibonacci.java at master · CSapprenticeWT/OnJava8-Examples · GitHub

Repository navigation

// functional/RecursiveFibonacci.java

// We make no guarantees that this code is fit for any purpose.

// Visit http://OnJava8.com 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: