阶乘（栈与递归实现）

#include<iostream>

#include <stack>

using namespace std;
int factorial(int num);
int factorialByStack(int num);

main()
{
int n = 10;
int result1;
int result2;
result1 = factorialByStack(n);
result2 = factorial(n);
cout<<result1<<"---------"<<result2<<endl;

return 0;
}

int factorialByStack(int num)
{
stack<int> tmp;
for(; num != 0; --num)
{
tmp.push(num);
}

int result = 1;

while( !tmp.empty() )
{
result *= tmp.top();
tmp.pop();
}

return result;
}

int factorial(int num)
{
if (1 == num)
{return 1;}
else
{return num*factorial(num-1);}
}