Recursion in Functional Programming

Memoization

Report a typo

How is memoization used in the Fibonacci sequence?

Select one option from the list

To store the results of previously calculated Fibonacci numbers and reusing them instead of recalculating them

To increase the number of recursive calls

It is not used in the Fibonacci sequence

To decrease the number of recursive calls

___

Create a free account to access the full topic