Question: Given the following recursive function definition, what is the stopping case? void factoria ( int n ) { if ( n = = 0 )

Given the following recursive function definition, what is the stopping case? void factoria(int n){ if (n ==0) return 1; return n*factorial(n-1); } n ==2 n ==1 n ==-1 n ==0

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock 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 Programming Questions!