Is it good programming that the following function call is recursive? void func(unsigned long a) { unsigned long x; struct t_struct[] p; : p = (struct t_struct )alloca(a*sizeof(t_struct)); : While (x = f2()) func(x); : return; }

Yes, because recursion is always preferable to iteration

No, because iteration is always preferable to recursion

No, because both stack depth and stack-frame size are unpredictable

No, because there is more than one 'long integer' type

Answer:
No, because both stack depth and stack-frame size are unpredictable

Note: This Question is unanswered, help us to find answer for this one

Is it good programming that the following function call is recursive? void func(unsigned long a) { unsigned long x; struct t_struct[] *p; : p = (struct t_struct *)alloca(a*sizeof(t_struct)); : While (x = f2()) func(x); : return; }