1999-04-16 01:35:26 +00:00
|
|
|
/*
|
|
|
|
* This simple classical example of recursion is useful for
|
|
|
|
* testing stack backtraces and such.
|
|
|
|
*/
|
|
|
|
|
2014-09-16 11:37:03 +00:00
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
1999-04-16 01:35:26 +00:00
|
|
|
|
1999-06-28 16:06:02 +00:00
|
|
|
int factorial (int);
|
|
|
|
|
|
|
|
int
|
|
|
|
main (int argc, char **argv, char **envp)
|
1999-04-16 01:35:26 +00:00
|
|
|
{
|
|
|
|
#ifdef FAKEARGV
|
2013-10-21 12:42:02 +00:00
|
|
|
printf ("%d\n", factorial (1)); /* commands.exp: hw local_var out of scope */
|
1999-04-16 01:35:26 +00:00
|
|
|
#else
|
|
|
|
if (argc != 2) {
|
|
|
|
printf ("usage: factorial <number>\n");
|
|
|
|
return 1;
|
|
|
|
} else {
|
|
|
|
printf ("%d\n", factorial (atoi (argv[1])));
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
1999-06-28 16:06:02 +00:00
|
|
|
int factorial (int value)
|
1999-04-16 01:35:26 +00:00
|
|
|
{
|
1999-06-28 16:06:02 +00:00
|
|
|
int local_var;
|
|
|
|
|
1999-04-16 01:35:26 +00:00
|
|
|
if (value > 1) {
|
|
|
|
value *= factorial (value - 1);
|
|
|
|
}
|
1999-06-28 16:06:02 +00:00
|
|
|
local_var = value;
|
1999-04-16 01:35:26 +00:00
|
|
|
return (value);
|
2013-10-21 12:42:02 +00:00
|
|
|
} /* commands.exp: local_var out of scope */
|