[Tutorial][C++] Factorial through recursion

If the number is 0, then this function will return 1,
If the number is 1, then this function will return 1,
If the number is 2, then this function will return 2,
If the number is 3, then this function will return 6,
If the number is 4, then this function will return 24,
If the number is 5, then this function will return 120,
If the number is 6, then this function will return 720,
If the number is 7, then this function will return 5040,
If the number is 8, then this function will return 40320,
If the number is 9, then this function will return 362880.

Click to expand...

unsigned long factorialRecursive( unsigned long number )
{
if ( number == 0 || number == 1 )
return 1;
else
return number * factorialRecursive( number - 1 );
}

Click to expand...

factorialRecursive ( 0 ) = 1
factorialRecursive ( 1 ) = 1

Click to expand...

number * factorialRecursive( number - 1 )

Click to expand...

#include "stdafx.h"
#include "iostream"
#include "conio.h"

using namespace std;

unsigned long factorialRecursive( unsigned long number )
{
      if ( number == 0 || number == 1 )
            return 1;
      else
            return number * factorialRecursive( number - 1 );
}

int main()
{
      for( unsigned long i = 0; i < 10; i++  )
            cout << i << "!" << factorialRecursive( i ) << endl;
      cout << endl;

      _getche();
      return 0;
}