Tag Mario,

you wrote me:

[Automatic stack size]

 MS> void stackEater(int x)
 MS> {
 MS>  if (x==0) return;

 MS>  char c[1000];
 MS>  x--;
 MS>  stackEater(x);
 MS> }

Smells recursive. I agree on your point. Without recursion however, i'm not
convinced yet. Maybe swap line if (x==0) return; and char c[1000];?

 MS> how much stack does this program need?

atoi(argv[1])*1000 bytes, maybe 1000 more or less. I see your point, the
amount of stack can not be determined in advance, due to the recursive
nature of the program.


Mit freundlichen Gruessen,
 Henk

--- GoldED 2.50+