what i mean by this, is write a recursive structure, which has the ability to save its values and look them up later

so when you figure out what fib(n) is, you can use that as a base case.

why this is good for both, since the fib() function has the algorithm efficiency of 2^n, you can see how much it helps the effiency, plus you can implement your data structure with a linked list, which is a more advanced data structure.

if youre not sure what any of the terms are i explained, let me know, id be glad to explain it in more detail.

~b