Computes the factorial of an integer iteratively: a loop, and recursively : Basics « Function « C++

1. C++
2. Function
3. Basics

Computes the factorial of an integer iteratively: a loop, and recursively

#include <iostream>
#include <iomanip>
using namespace std;
#define LENGTH   20
long double iterativeFunction(unsigned int n);  // Iterative solution
long double recursiveFunction(unsigned int n);  // Recursive solution
int main()
{
   unsigned int n;


   cout << fixed << setprecision(0);

   cout << setw(10) << "n" << setw(30) << "Factorial of n"
        << "           (Iterative solution)\n" << endl;
   for( n = 0; n <= LENGTH;  ++n)
      cout << setw(10) << n << setw(30) << iterativeFunction(n)
           << endl;
   cout << "Go on with <return>";
   cin.get();

   cout << setw(10) << "n" << setw(30) << "Factorial of n"
        << "           (Recursive solution)\n"  << endl;
   for( n = 0; n <= LENGTH;  ++n)
      cout << setw(10) << n << setw(30) << recursiveFunction(n)
           << endl;
   cout << endl;
   return 0;
}
long double iterativeFunction(unsigned int n)       // Iterative solution.
{                                       
   long double result = 1.0;
   for( unsigned int i = 2; i <= n; ++i)
       result *= i;
   return result;
}
long double recursiveFunction(unsigned int n)       // Recursive solution.
{                                       
   if( n <= 1)
      return 1.0;
   else
      return recursiveFunction(n-1) * n;
} 

           
       

Related examples in the same category

1.	Class as a return type
2.	Another example of a conversion function
3.	A C++ program with several functions
4.	Throwing an exception from a function