Login | Register   
RSS Feed
Download our iPhone app
Browse DevX
Sign up for e-mail newsletters from DevX

By submitting your information, you agree that devx.com may send you DevX offers via email, phone and text message, as well as email offers about other products and services that DevX believes may be of interest to you. DevX will process your information in accordance with the Quinstreet Privacy Policy.

Tip of the Day
Language: C++
Expertise: Intermediate
Oct 31, 2000



Application Security Testing: An Integral Part of DevOps

Factorial Function

One of the classic examples of using recursion is calculating a factorial of a number. Here's a typical implementation of this function:

int factorial (int num)
 if (num==1)
  return 1;
 return factorial(num-1)*num; // recursive call

factorial() calls itself recursively, subtracting 1 from num on each call, until it equals 1. As always, you can use iteration instead of recursion:

int factorial (int num)
 int result=1;
 for (int i=1; i<=num; ++i)
 return result;
Danny Kalev
Comment and Contribute






(Maximum characters: 1200). You have 1200 characters left.



Thanks for your registration, follow us on our social networks to keep up-to-date