To learn about recursion, first we must talk about recursion.
Took me a while to get it because it’s a bit of a stretch but still somewhat funny
is tail recursion really recursion?
Yes.
Structure and Interpretation of Computer Programs makes a distinction between recursive procedures and recursive process. A recursive procedure calls itself, but the compiler or runtime could potentially process it in an iterative way. The stack won’t blow up. A recursive process, however, will always blow up the stack if left unchecked.
I wouldn’t even really call this recursion. This is closer to a wrapper around the enjoy function to set variables so that “enjoy” doesn’t throw an error.
The more accurate, yet not at all funny interpretation
I find it as funny as the original post
The best kind of funny
Depends on your optimization level.
Oh. Now I get it. Thanks.
Out of milk: Killed process 8008135
Or, alternately, if step one doesn’t internally handle the cap being missing it silently hangs or halts there, and the user is too busy catatonically staring at the spout to enjoy anything.
