FilesExpand file tree

 master

/

RecursiveFibonacci.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

32 lines (31 loc) · 651 Bytes

 master

/

RecursiveFibonacci.java

Copy path

Top

File metadata and controls

• Code
• Blame

32 lines (31 loc) · 651 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

// functional/RecursiveFibonacci.java

// (c)2021 MindView LLC: see Copyright.txt

// 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:

0

1

1

2

3

5

8

13

21

34

55

*/