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 function from these rules, what would the base case be? What
would the recursive case be?
Sorry the answer is not available at the moment…
If you are able to find the answer, please make sure to post it here. So that your Juniors have smile on their lips and feel happy.
Spread the 'tradition of sharing'.