I was trying to make a recursive function that can calculate the Fibonacci of the enter number, by the way I got stuck on how to get the values obtained by the recursion.
I do believe that you know "coding FIBONACCI with recursion is NOT a good idea".
recursive Fib() -> O(2^n) iterative Fib() -> O(n)
Please reference to this youtube video.