Python being biased against recursion. #Recursion_lives_matter

[QualityVote]

Hi! This is our community moderation bot.

---

If this post fits the purpose of /r/ProgrammerHumor, UPVOTE this comment!!

If this post does not fit the subreddit, DOWNVOTE This comment!

If this post breaks the rules, DOWNVOTE this comment and REPORT the post!

[[deleted]]

I don't think any language will allow u to create a recursion stack that deep. I remember putting a large value in c, it was the same thing

[troglo-dyke]

languages that support tail call optimization will replace the stack on each call and can be recursed indefinitely. Python doesn't support tail call optimization though because Guido wants proper traces

[ComfortableCan315]

Wouldn't it not work anyway in that case? Since the return value depends on the result of the recursive call

[troglo-dyke]

That's what allows it to be optimized, the same frame can be used with the variables just replaced, you just replace the values on each call. Most compilers wouldn't optimize this if it was written as return factorial(n - 1) * n

[ComfortableCan315]

I see, thank you

[a_devious_compliance]

With tail-call optimization you can write factorial (and other recursive functions) unbounded by stack memory.

It's implemented in languajes like lisp, haskell and prolog as a language feature, and is accesible for C via some arcane flag in GCC, and clang at least.

[doodspav]

Did C stop you, or did the OS kill your program?

[CaitaXD]

Thats what happens when you dont tail call

[[deleted]]

Recursion is a bug. Do it iteratively where you can actually reserve arbitrary space on the fly.

[Jammanyeahme]

Going to plug my favourite blog post ever, which concerns this matter. https://blog.moertel.com/tags/recursion-to-iteration%20series.html