Loading...
Is this your company?
Recursive calculate n! Write down code
Anonymous
int factorial(int n) { if(n==0) // calculates zero factorial which is equal to 1 return 1; else return n*fact(n-1); }
int factorial( int n) { if (n==1) return 1 else return n* factorial( n-1) ; }
Stay ahead in opportunities and insider tips by following your dream companies.
Get personalised job recommendations and updates by starting your searches.
Get actionable career advice tailored to you by joining more bowls.
Check out your Company Bowl for anonymous work chats.