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

1 Expert Approved Answer
Step: 1 Unlock

Base Case The base case is the condition that stops the recursio... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Starting Out With Programming Logic And Design Questions!