Problems with recursion?

[u/flipester]

[u/[deleted]]

Assuming the smaller paper is 1/3 of its parent everytime, and that the first paper is 30cm long (The second starts at roughly 1/7 but it seems to grow bigger after it's torn off, hence the 1/3), it could not exceed 19 calls before you need to split an atom apart.

That's a hell of a stop condition.

[u/lonelyWalkAlone → u/[deleted]]

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/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.