The goal for this exercise is to practice writing (increasingly complex) recursive code, this time using a modern twist on a classic example of recursion.
For
this exercise, you need to implement the Fibonacci_Array
method in the provided RecursiveMethods class.
This class should be found in
the Student_Answers.cs file. Fibonacci_Array
will fill an array with the Fibonacci numbers, recursively. The array to
be filled will be passed in as a parameter. Remember that the Fibonacci
numbers are defined as follows:
Fibonacci(0) = 0
Fibonacci(1) = 1
Fibonacci(N) = Fibonacci(N – 1) + Fibonacci(N – 2)
Hint: You may want to start this by implementing the method using a loop. Once you've got that up and running, replace the loop with a recursive function to print out the array.
What you need to do for this exercise:
Fibonacci_Array, as described aboveNUnit_Tests_Fibonacci_Array
class). This class is currently commented out, but if you want to
run those tests you can un-comment the these tests.