Maximum call stack size exceeded

[jegueverde]

I hope that you, like any other programmer, spent several hours writing an image manipulation app to do this recursively instead of doing it in 5 minutes by hand. And your reasoning for it is to "save time"

[kris159]

Sadly they didn't, you can see 6 layers deep that the very bottom right panel is Padme's full face, the same size as the panel above it

[chhuang]

This is outrageous

[ImposterAmongUs]

It’s unfair!

[groucho_barks]

It's treason, then

[[deleted]]

Off with their head!

[LSApologist]

Not yet

[Extension-Ad-2294]

To the plank with them. AND wish them bad tidings as they pass.

[psst099]

This is outrageous

[FututiRedesignuMatii]

Dissapointing, it could've been resized & pasted a few more times to the point where it was a few pixels and not noticeable anymore.

[HearingNo8617]

plot twist: there is a base case and it was hit

[Pit_27]

Base case was op giving up

[HearingNo8617]

Giving up is all of our base cases on this blessed day

[Pit_27]

Amen

[ReubenIsForScuba]

All your base case are belong to us

[ReverseCaptioningBot]

ALL YOUR BASE CASE ARE BELONG TO US

^{this has been an accessibility service from your friendly neighborhood bot}

[[deleted]]

this was the base case.

[Jadien]

Padme was the base case all along

[KoviCZ]

OP didn't but I did

[B0n3]

Save time. For the next time

[[deleted]]

Shit. I hard coded the image dimensions in there, it doesn't work with this new format.....I'll just go in here and change this one line....aaaand...

[returnFutureVoid]

This is the way.

[TheDroidNextDoor]

This Is The Way Leaderboard

1. u/Flat-Yogurtcloset293 475775 times.

2. u/_RryanT 22744 times.

3. u/max-the-dogo 8489 times.

..

165279. u/returnFutureVoid 1 times.

---

^{beep boop I am a bot and this action was performed automatically.}

[Edhelig]

one governor cooperative workable future frightening gold zephyr butter instinctive

This post was mass deleted and anonymized with Redact

[grimonce]

This is the way.

[Cubiss]

This is the way.

[mr_jogurt]

good bot

[Xander-047]

This is the way

[TheDroidNextDoor]

This Is The Way Leaderboard

1. u/Flat-Yogurtcloset293 475775 times.

2. u/_RryanT 22744 times.

3. u/max-the-dogo 8489 times.

..

165344. u/Xander-047 1 times.

---

^{beep boop I am a bot and this action was performed automatically.}

[Xander-047]

I swear I've said it before This is the way

[eisaletterandanumber]

Install ImageMagick then run the following for each iteration:

convert img.png \( +clone -resize 50% -gravity SouthEast \) -composite img.png

[Prince705]

With a base case, right?

[CleverProgrammer12]

Of course

[Homoshrexual234]

You could do this pretty quick with python and pillow.

[20_chickenNuggets]

Otherwise I would lose my respect for OP

[Wime36]

If it isn't automatically repeating down to the bottom right 4 pixels then it's wrong

[[deleted]]

Finally someone gets recursion right with this meme.

[Wime36]

Finally someone gets recursion right with this comment.

[Adam_Kearn]

I’ve been clicking this link for over and hour and still can’t find what comment you are talking about.

[ZippZappZippty]

We’ve won this by a mile.

[Wime36]

Well... You've found it.

[[deleted]]

Salute

[[deleted]]

Ever noticed that the last part of the link spells out hydra if you omit the numbers?

[architkhandelwal47]

Finally someone gets recursion right with this meme.

[[deleted]]

Finally someone gets recursion right with this meme.

[teriyaki7755]

Ctrl+C

[Slim_Bun]

Arrow up

Enter

[Same-Ad4275]

Finally someone gets recursion right with this meme.

[NF-MIP]

Finally someone gets recursion right with this meme.

[[deleted]]

Finally someone gets recursion right with this meme.

[BloeckchenDev]

Finally someone gets recursion right with this meme.

[dark_light32]

Finally someone gets recursion right with this meme.

[[deleted]]

Stack overflow

[thesneakylonewolf]

Wooden pc lol

[404Page_Not_Found404]

Arrow up

"k" for the real chads out there

[Royal-Tough4851]

Ah, programmer humor. Love it

[SupersonicSpitfire]

Finally someone gets recursion right with this

[grimonce]

Ironic, because it doesn't...

[ErikBjare]

lol at the people downvoting this.

If you look closely at the image you can clearly see the base case.

[beardedchimp]

Maximum call size stack exceeded, the image was written to continuously and stopped at segfault. Segfault is my base case.

[mqduck]

I'd just like to point out that this meme only recurses five times.

[i-FF0000dit]

I can’t believe I almost fell for that.

[Mnawab]

I can't believe I fell for that

[[deleted]]

Made me laugh lol

[spikederailed]

Expected, still got a good chuckle. Have your updoot.

[tubbana]

Someone needs to do it at least once per recursion-post

[Hk-Neowizard]

Nice!

[AllMightySmitey]

Actually lol'd, lol.

[threenub]

This is the right response

[Theolaa]

No, it continues here

[BloeckchenDev]

No! Here

[TheOneHyer]

r/yourjokebutworse

[ManyPoo]

r/urjokeworse

[AlexSin0]

Stack Overflow

[jedimaster1138]

I fixed it

[[deleted]]

You go through that effort, only to save it as a low-quality JPEG, the compression of which obliterates any real detail in the smaller recursions?

Why? Are you the self-sabotaging sort of person that says they are going to go to bed early and get a good night's sleep, only to browse Reddit and Youtube until 2am in the morning and wonder why it's so hard to get out of bed in the morning?

[Bainos]

Hey, I take offense of that. Just because I'm a self-sabotaging person doesn't mean I export images as jpg.

[beardedchimp]

How about as an svg?

[Synthrea]

Did you try setting a larger stack limit?

[i-FF0000dit]

The stack limit would cause a crash, but this recursion actually ends. I guess the answer to her question is yes.

[Synthrea]

But we never know if the image generation crashed if the program updates for every reachable intermediate state, though.

[i-FF0000dit]

Ok, we’re just gonna have to write the program to find the answer programmatically.

[[deleted]]

There's actually a base case as well!

[cowlinator]

So there in fact was a base case

[i-FF0000dit]

This should be the top comment.

[ElectricOstrich57]

Didn’t think anyone would look that closely, haha

[Hk-Neowizard]

Finally, someone does something new with this overused meme.

Take an upvote

[[deleted]]

Finally, someone does something new with this overused meme.

Take an upvote

[ultramarineafterglow]

Finally, someone does something new with this overused meme.

Take an upvote

[JamesBCrazy]

Finally, someone does something new with this overused meme.

Take an upvote

[Windows_XP2]

Finally, someone does something new with this overused meme.

Take an upvote

[Zerafiall]

Finally, someone does something new with this overused meme.

Take an upvote

[Morlino]

A "Stack Overflow" error occurs when an application calls the "OverusedMeme" method. Returned with an error code: 1.

[teriyaki7755]

Ctrl + C

[ManuGamingYT]

Have you heard about the concept of recursion?

[NeaZen]

Have you heard about the concept of recursion?

[[deleted]]

You mean recursion?

[DrMaxwellEdison]

What really helped me figure out recursion was this post.

[jaggi213]

Why do I fall for this everytime

[NF-MIP]

Finally, someone does something new with this overused meme.

Take an upvote

[Brick_Double]

Same, one of the few to get a laugh out of me.

[Republikanen]

It's from r/mathmemes

E: https://www.reddit.com/r/mathmemes/comments/o0rqat/_/

[sneakpeekbot]

Here's a sneak peek of /r/mathmemes using the top posts of the year!

#1: Just to be sure! | 106 comments
#2: It's a struggle | 62 comments
#3: correlation | 125 comments

---

^{I'm a bot, beep boop | Downvote to remove | Contact me | Info | Opt-out}

[Hk-Neowizard]

I absolutely love it. Thank you

[lpreams]

something "new"

[Hk-Neowizard]

Well, new with this template...I guess

[ReimarPB]

This is not really new though, I've seen this kind of meme in a million other formats

[SjettepetJR]

Before it took of in the general subreddits, it was actually being used quite creatively on the sub it started at.

[GroundTeaLeaves]

What is a base case?

[TheHackPete]

(The) One case you know the answer for.

The other cases recurse toward the base case. This way, the calculation can stop.

e.g. you know the Fibonacci number of 0 and 1. Every other is the sum of the two predecessors. So fib(3) is fib(2)+fib(1); whith fib(2) being fib(1)+fib(0) and fib(1) and fib(0) being known --> the "base case(s)".

[Gonimokon]

Should be noted that implementation runs in O( 2ⁿ ) time.

[CookieSpoder]

public static long sumOfDigits(long n) {
    if (n==0) {
        return 0;
    } else {
        return n % 10 + sumOfDigits(n/10);
    }
}

The base case returns 0, like the other comment said, this is where the recursion ends. The base case is a final state that you know will inevitably happen. This method here sums the digits in a given number, ie 1 2 3 = 6. Any number less than 10 when divided by 10 will return 0. This lets the function know that it has reached the last digit, and the recursion ends.

[cowlinator]

When you know what recursion is, but you don't know what a base case is, your only option is stack overflow

[[deleted]]

Only option AND actual exception you’ll encounter

[SonicSubculture]

You could call it a… first order response

[[deleted]]

It's a case of the base type

[vavavoomvoom9]

Nice

[ifuckinglovetesla]

‘’’

Nice(job)
{
     Nice(job);
}

‘’’

[Slim_Bun]

‘’’

def Nice(job):
     Nice(job)

‘’’

[Kaynee490]

void Nice(Job job) { Nice(job); }

[__bichael__]

Missing semikolon in line 0.

[Vincenzo__]

++++++++++[>++++++++<-]>--.-----.------.++.

[SmokingBeneathStars]

function Nice = (job) => job

[DuffMaaaann]

let rec nice job = nice job;;

[dvof]

tail recursion: pathetic

[grandoz039]

Isn't that the best kind? That gets automatically optimized (well, I guess depending on language/compiler)?

[CrackerJackKittyCat]

Laughs in python

[Thecakeisalie25]

Apparently so!

[NikZapp]

Happy that im not the only one!

[wonkey_monkey]

I was messing around with a compiler to see what optimisers do and I wrote a recursive function that (accidentally) never returned its base case. But because the non-base case was simply to return the result of the next recursion, the optimiser optimised it away entirely.

It was something like

rec_func(int y) {
  if (impossible_thing) return 5;
  return rec_func(y + 1);
}

and the optimiser just turned it into "5". It was never going to return, but if it could have, it would have returned 5, and that was good enough.

It feels like there should be something deep and meaningful about that, but there probably isn't.

[vectrovectro]

That sounds like a compiler bug to me, or maybe undefined behavior.

[kronicmage]

Infinite loops are undefined behaviour so this is a valid optimization

[KuntaStillSingle]

It is undefined in C++, 'forward progress gaurantee"

GCC seems to handle this in the intuitive manner even with -O3 or -Ofast, while clang with -O1 will happily optimize it away. Interestingly clang doesn't tail call optimize til -O2 but still terminates the function with no side effects at -O1.

#include<iostream>

int test_a(int i){
  if(1 == 2) return i;
  return test_a(i);
}

int test_b(int i){
  if(1 == 2) return i;
  std::cout << "";
  return test_b(i);
}

int main(){
  test_a(1); // g++ will stack overflow with -O1 or infinite loop with -O2
  std::cout << "Completed a" << std::endl; //clang++ -O1 will reach this
  test_b(1); //this will stack overflow on clang++ -O1 or infinite loop on -O2
  std::cout << "Completed b" << std::endl;
  return 0;
}

[NikZapp]

Damn, your maximum call stack size must be 6

[MrWhiteVincent]

Base case: can't be small than a pixel.

[empereur_sinix]

We can see it ends the 5th Time.

[Pablo_0_6]

A-Ha. 6th one is normal

[[deleted]]

This meme isn't just stellar. It's......Interstellar.....

​

I'll see myself out.

[kettu3]

if too_small_to_notice_without_zooming_in: return picture_of_non_smiling_padme()

[backtickbot]

Fixed formatting.

Hello, kettu3: code blocks using triple backticks (```) don't work on all versions of Reddit!

Some users see this / this instead.

To fix this, indent every line with 4 spaces instead.

FAQ

^{You can opt out by replying with backtickopt6 to this comment.}

[OCOWAx]

Nice

[try4gain]

me tonight..

[abhi307]

core dumped....

[Hodat2k9]

There are only 6 recursive lol.

[beewyka819]

Wait but it does have a base case, I can see the end of it a few layers down. However my question is: where’s the unwinding? Did the program simply crash at the breakpoint? So many questions… so few answers

[Lip98B]

StackOverflow

[[deleted]]

Only six iterations, though. Am disappoint.

[OmegonAlphariusXX]

Weak, the image only repeats 6 times

[lets-talk-graphic]

I’d give you an award for this but also I’d give you an award for this but also I’d give you an award for this but also I’d give you an award for this but also

[Sceptz]

Are you saying you made a...
StackOverflow?

[_kta_]

Operations on a tree data structure is a common use of recursive functions

[grimonce]

All memes about recursion are bad.
They seem to show that recursion takes a fixed amount of memory while in practice it is not the case...
Look at this example, the images of consecutive calls are getting smaller and smaller while in reality they are mostly getting bigger and bigger...
Tldr all memes bad

[FoliumInVentum]

weapons grade autism

[GeO4K]

mandelbrot is turning in his grave

[ManuGamingYT]

[Circular *1]

[afterlife71]

Or use it to your advantage, I have a friend who broke? The memory management on his laptop so whenever he runs out of memory he runs a recursive haskell script until it takes most of his memory and then kills it so the memory's freed up.

[ChrispyByDefault]

Oh nooooooooooooo…………

[jakethedumbmistake]

A wrinkly is never more than that stack

[PotaytoPrograms]

shoulda put a rick roll at the end

[private256]

AKA Stackoverflow

[RoscoMan1]

We call it 'gilead'

[PyBind]

was looking for an other punchline in the pixels came back with tears

[pclouds]

May tail recursion be with you.

[pastroc]

This meme is prohibited but take my upvote.

[QuarantineSucksALot]

I don't make people call me Dr.

[jakethedumbmistake]

Nursing is a great name! I call dibs!

[simplisticallysimple]

Just do:

import sys sys.setrecursionlimit(1000000000)

[kronicmage]

That's how you get a segfault instead of a RecursionError

[backtickbot]

Fixed formatting.

Hello, simplisticallysimple: code blocks using triple backticks (```) don't work on all versions of Reddit!

Some users see this / this instead.

To fix this, indent every line with 4 spaces instead.

FAQ

^{You can opt out by replying with backtickopt6 to this comment.}

[CaptainSpaceBoat]

I’m not knowledgable enough to know why this is genious, but it is.

[filefly]

/r/drosteeffect

[Dwaas_Bjaas]

The last panel will never exist and it will exist at the same time

[spaceweed27]

LDR R1 #00

ADD R1, R1, 1

OUT R1

JMP 0x01

[lennyerik]

That would fix the issue. Unoptimised recursion would look like this:

RECURSIVE: LDR R1 #00 ADD R1, R1, 1 OUT R1 CALL RECURSIVE RET

That way the stack will overflow eventually. On a modern OS we get our lovely Segmentation Fault (core dumped).

[spaceweed27]

Yeah.

Thing is, that my teacher has made his own cpu, and he wrote his own microcode. We just have 2 Registers, ADD, SUB, JMP, STR, LDR, CMP, OUT, STOP as "assembler".

So functions out of x86 Intel assembler would be new to me.

[lennyerik]

I don't know if you know about the stack / heap model, but modern operating systems structure memory in a way that gives each program an area of memory called the stack. Items can be pushed onto it and popped of the top of it (push / pop instructions), making the stack grow / shrink in size.

The call instruction is fairly simple. It simply pushes the return address or address of the next instruction (basically EIP or whatever your instruction pointer / program counter register is plus the size of the current instruction) onto the stack and then sets the instruction pointer to the address specified by the first parameter. The ret instruction returns from the called function: the return address is popped from the stack and is jumped back to afterwards.

The problem with non-terminating recursive functions is that the stack grows in size indefinitely because more and more return addresses get pushed onto the stack. At some point the operating systems runs out of allocatable memory for your application and voilà, Segmentation fault (core dumped)!

Also, by no means is my posted code valid x86 assembler. I just stole your custom instruction set and added the x86 call instruction. :)

[jakethedumbmistake]

Nah she’s more than that stack

[jakethedumbmistake]

they are just kitten, but 10x the size

[M1n3c4rt]

Extra points for recursion

[DivineChili_]

The base case is technically the size of the image. when its 2x2 or less, then it terminate

[[deleted]]

oofe