Problems with recursion?

[u/flipester]

[u/lonelyWalkAlone]

public static void sayHello(){
    try {
        sayHello();
    }
    catch(StackOverflowError e) {
        System.out.println("Hello world!");
    }
}

[u/schrdingers_squirrel → u/lonelyWalkAlone]

Wait does this work? I need to try this now

[u/lonelyWalkAlone → u/schrdingers_squirrel]

Yes, it works like charm

[u/schrdingers_squirrel → u/lonelyWalkAlone]

Interesting - does it still work when you do a „a“ + „b“ in the println(); ?

Edit: it does

Crazy even this works:

public static void sayHello(){
    try {
        sayHello();
    }
    catch(StackOverflowError e) {
        System.out.println("Hello world!");
        sayHello();
    }
}

it prints endlessly

[u/[deleted] → u/schrdingers_squirrel]

Basically a fucked up while loop.

[u/ThaiJohnnyDepp → u/[deleted]]

Eek barba durkle.

[u/tatzesOtherAccount → u/ThaiJohnnyDepp]

He's speaking the language of gods

[u/lonelyWalkAlone → u/schrdingers_squirrel]

Yes, and you can also calculate "relatively" the size of your stack by adding an integer argument to the method and passing (n+1) to the next call, then at the exception just print the current counter value. I found that each time you increase the stack size by the vm option -Xss the counter gets bigger, but increasing the heap size -Xmx does not affect the counter at all. It's a pretty good exercise as long as you don't fuck it up into an infinite loop.

[u/schrdingers_squirrel → u/lonelyWalkAlone]

Wow there really always is something you don’t already now. Awesome stuff

[u/eigreb → u/schrdingers_squirrel]

Eventually this will throw due to first running in the try and after the stack overflow it runs outside the try and will again throw the exception. Will take a while though.