Question: In this chapter, the rules given for calculating the factorial of a number are as follows: If n = 0 then factorial ( n )
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?
Step by Step Solution
3.47 Rating (163 Votes )
There are 3 Steps involved in it
Base Case The base case is the condition that stops the recursio... View full answer
Get step-by-step solutions from verified subject matter experts
