In this chapter, the rules given for calculating the factorial of a number are as follows: If

Question:

In this chapter, the rules given for calculating the factorial of a number are as follows:
If n = 0 then factorial ( n ) = 1
If n > 0 then factorial ( n ) = n × factorial ( n − 1)
If you were designing a module from these rules, what would the base case be? What would the recursive case be?

Fantastic news! We've Found the answer you've been seeking!