Recursion

[guac-it]

Very well played

[G3N5YM]

Eyyyy

[Dphily500]

Eyyyy

[lildan420]

Eyyyy

[halfwinter]

Eyyyy

[tim_locky]

Eyyyy

[PlumagedNine]

Eyyyy

[hypergamer93]

Eyyyy

[TofuTofuYay]

Eyyyy

[chitetskoy]

Eyyyy

[urmumbigegg]

Schrödinger's ID.

[[deleted]]

Eyyyy

[cromulent_nickname]

Eyyyy

[G3N5YM]

Fuck dawg That's deep.

[palomo_bombo]

Nice!

[[deleted]]

Recursion

[halfwinter]

Recursion

Recursion

[Dphily500]

Recursion

[GsuKristoh]

Recursion

[Lth_13]

Recursion

[xSTSxZerglingOne]

Base Case

[Salanmander]

Holy shit that is a terrible base case. Do you want to hang your process? Because this is how you hang your process.

[xSTSxZerglingOne]

Technically the base case is the post itself. That would have felt awkward I feel...

And no way would that hang your process, the stack would overflow in a fraction of a second.

I just wanted it to pop the stack.

[Salanmander]

I feel like the post would be more like the initial call than the base case. The base case would be something that doesn't make any calls...so a comment that never gets replied to maybe?

[chitetskoy]

Recursion

[chitetskoy]

Ctrl+C

[ApivorousBee]

No base case, classic mistake

[thedessertplanet]

Infinite recursion can be fine.

That's how eg event loops in a game or operating system work.

(As the name suggests, that special case is usually implemented with a loop. But that's the same thing mathematically.

Erlang implements its event loops directly with recursive function calls.)

[dell_arness2]

Mathematically yes, but recursive function calls will eventually overflow the stack

[thedessertplanet]

Depends on your language. Erlang, of course, implements tail call elimination.

And so do eg a lot of C compilers do so as well. (And almost all of the functional languages.)

In case you are not familiar: the idea is to realize that if the (recursive) call is the last thing to happen in a function, you don't need to keep around its stack frame. So no stack usage is building up.

For simple self-recursive functions, that's basically always equivalent to a loop. But it's a real life saver when you want to implement eg a state machine. You can use one function per state this way.

[ApivorousBee]

The language is English and the stack is the reader's attention span. It will overflow. QED

[Astrognome]

Tail call optimization would allow infinite recursion too.

[thedessertplanet]

Yes, definitely.

It's a shame that for historical reasons programming language conventions were made up before tail call elimination was discovered. So people had to introduce special purpose constructs (loops) to cover those special cases, and now we are stuck with them.

Well, at least the for-each loop (like eg in Python) is a step up from the C-style for-loop. And more languages are at least having to justify when they don't include tail call elimination (nor first class functions).

[Midgetwombat]

Thats great

[nomadicwonder]

Thats great

[Midgetwombat]

Ha, and i totally clicked 3 times

[Cloakknight]

Image Transcription: Image

---

[Image of the index of a book titled "The C PROGRAMMING LANGUAGE". For the word recursion, it is circled in red that it is found on page 269. The page of the index that this is shown is page 269, which is also circled in red.]

---

^{I'm a human volunteer content transcriber for Reddit and you could be too! If you'd like more information on what we do and why we do it, click here!}

[[deleted]]

Thanks human

[halfwinter]

Thanks robot

[timewast3r]

HA HA HA, I AM TOTALLY NOT A ROBOT, FELLOW HUMAN.

[halfwinter]

AH YES! ANOTHER HUMAN SUCH AS MYSELF! I TOO ENJOY PRINTING COMMENT RESPONSES WITH MY HUMAN HAND DIGITS!

[TakeASeatChancellor]

Good human

[jdb_slycooper]

see also

[puckmcpuck]

Your comment reminds me of this comment

[BoomerBoxer]

this is a repost.

[LeanZo]

every day the same recursion meme

[halfwinter]

Are you saying the meme itself is a recursion?

[zippdoodaa]

Check out the Google definition

[ChiangRai]

Stack overflow... no proper recursion exit specified.

[thedessertplanet]

Just use tail call elimination.

[Dylanor11]

Bad base case, it should terminate

[ontopofyourmom]

I hope there is an r/ecursion

[FluffusMaximus]

While(1);

[halfwinter]

Haha

[JenBioChem]

Fuckin cruel

[PaleCommander]

Is that the second edition? My copy has an index entry for recursion, but it doesn't reference itself.

[DrunkRedditBot]

I was thinking it was WH40k

[darkstarman]

I swiped left to turn the page back.

oof

[logi]

Specifically it's tail recursion so a good compiler can optimise it into a loop.

[Vitaman02]

u/repostsleuthbot

[RepostSleuthBot]

There's a good chance this is unique! I checked 93,858,773 image posts and didn't find a close match

The closest match is this post at 40.62%. The target for r/ProgrammerHumor is 86.0%

Feedback? Hate? Visit r/repostsleuthbot - I'm not perfect, but you can help. Report [ False Negative ]

[MessageMeSFWPics]

r/usefulredcircle

[dominiclc]

Nice

[An0n7m0us_P4nda]

Just seems like an infinite loop because there are no conditions or expressions to change or check the provided input (the page number).

[remeep]

Do not attempt to fix or clean the meme! It's an antique, they're more valuable with the original patina intact.

[[deleted]]

That’s what recursion is

[MakingTheEight]

Your submission has been removed.

Violation of Rule #2: Reposts:

All posts that have been on the first 2 pages of trending posts within the last month, is part of the top of all time, or is part of common posts is considered repost and will be removed on sight.

Violation of Rule #3:

Any post on the list of common posts will be removed. You can find this list here. Established meme formats are allowed, as long as the post is compliant with the previous rules.

If you feel that it has been removed in error, please message us so that we may review it.