find the first 20 numbers of the Fibonacci sequence and puts into a list using recursive way.. Example - List<Integer> l1 = ne

Question

// I'm stuck and I could really use the help.

import java.util.*;

public class answer {

public static int fib(int[] f, int n)
{
int ret = 0;
if(n <= 2)
ret = 1;
else
ret = fib(f, n-1) + fib(f, n-2);
f[n-1] = ret;
return ret;
}
public static void main(String[] args) {
// TODO Auto-generated method stub
List<Integer> ll = new ArrayList<Integer>(20);
ll.add(0, 1);
ll.add(1, 2);
int[] f = new int[20];
fib(f, 20);
for(int i = 0; i < 20; i++)
System.out.print(ll);
}

}

Answer 1

https://code.sololearn.com/c7yf1M6Pt9iO/?ref=app

Answer 2

Please do not write sentence in Relevant Tags 👍

Answer 3

Maria Vasilyova fixed

Answer 4

Ify Nonyelu look at the code I sent

Answer 5

Ok Ellya and Maria and thank you both

Answer 6

I have to use a list but I'm not sure how to do it.