Computing a value recursively: Factorial

 

The goal for this exercise is to practice writing (increasingly complex) recursive code, this time using a classic example of recursion.

 

For this exercise, you need to implement the Factorial method in the provided RecursiveMethods class. 

 This class should be found in the Student_Answers.cs file.   You need to add code to the Factorial method, which will compute Factorial(N).  Factorial is defined as:

Factorial(N) = N * Factorial(N-1)
Factorial(0) = 1

            Your function should have a single parameter, n, and return the Factorial of n.  Any value of n less than 0 should simply return 0;

 

What you need to do for this exercise: 

1. Implement Factorial, as described above
2. Since this exercise isn't a Hand-In (nor a Required) exercise you don't need to make any tests pass.
   HOWEVER
   There are tests available for it (in the NUnit_Tests_Factorial_Recursive class).  This class is currently commented out, but if you want to run those tests you can un-comment the these tests.