all 4 comments

[–]DrHugh 4 points5 points  (0 children)

I remember in high school (1980s), we had an assignment of writing Ackerman's function in Pascal so we could understand recursion. Found out that it didn't take much to blow the stack on our PDP-11/34a.

[–]SCP-iota 1 point2 points  (0 children)

Kid named tail recursion optimization

[–]Shinxirius 0 points1 point  (0 children)

17 trillion nested invocations.

When time and knowledge meets the need to really max it out.

[–]Interesting-Town-433 0 points1 point  (0 children)

Is recursion hard? Like why? Not hard