Name: Anonymous 2010-02-27 9:06
Let's say that I have a function in which, say, we define a variable. It might look something like this:
int dicks (int cocks)
{
int wangs;
/* Do stuff to wangs and cocks here */
return wangs;
}Looking at
int wangs; it seems that the compiler translates that line into "allocate space for an integer and return a pointer to it." If this is a case, is the compiler setting aside space for a new integer every time I run the function, or does it optimize by assuming that I'm only going to have one instance of it and just set aside space for a single int?Whatever the answer to that previous question is, how would the compiler handle a recursive function? How would
Never mind, I'm an idiot. I forgot about registers and the stack for a second. I revoke my previous questions.
NEW QUESTION: What is the point of tail-call optimization? If all it does is convert recursive functions into iterative ones, why not just program them that way in the first place?