Iterativ sieht der Algorithmus so aus:
[code:1]
int doFak(int n)
{
int f = 1;
for (int k = 1; k <= n ; k++)
{
f = f * k ;
}
return f;
}
[/code:1]
[code:1]
int doFak(int n)
{
int f = 1;
for (int k = 1; k <= n ; k++)
{
f = f * k ;
}
return f;
}
[/code:1]
mfg KC