134
recursion (lemmy.ca)
you are viewing a single comment's thread
view the rest of the comments
[-] Jumuta@sh.itjust.works 40 points 4 months ago

is tail recursion really recursion?

[-] qarbone@lemmy.world 26 points 4 months ago

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.

[-] entropicdrift@lemmy.sdf.org 8 points 4 months ago

The more accurate, yet not at all funny interpretation

[-] qarbone@lemmy.world 4 points 4 months ago

I find it as funny as the original post

[-] HeckGazer@programming.dev 1 points 4 months ago

The best kind of funny

[-] sik0fewl@lemmy.ca 18 points 4 months ago

Depends on your optimization level.

[-] MajorHavoc@programming.dev 9 points 4 months ago

Oh. Now I get it. Thanks.

[-] frezik@midwest.social 1 points 4 months ago

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.

this post was submitted on 05 Feb 2025
134 points (84.9% liked)

Programmer Humor

24478 readers
168 users here now

Welcome to Programmer Humor!

This is a place where you can post jokes, memes, humor, etc. related to programming!

For sharing awful code theres also Programming Horror.

Rules

founded 2 years ago
MODERATORS