@[email protected] to [email protected]English • edit-24 months agoWine acronymlemmy.camessage-square81fedilinkarrow-up1553
arrow-up1553imageWine acronymlemmy.ca@[email protected] to [email protected]English • edit-24 months agomessage-square81fedilink
minus-squareѕєχυαℓ ρσℓутσρєlinkfedilink2•4 months agoI haven’t really done much recursion in Python, but can’t we do a tail-recursive version so that it (almost) never reaches recursion depth issues?
minus-square@[email protected]linkfedilink5•4 months agoWe cannot, Python explicitly doesn’t do TCO. http://neopythonic.blogspot.com/2009/04/tail-recursion-elimination.html?m=1
I haven’t really done much recursion in Python, but can’t we do a tail-recursive version so that it (almost) never reaches recursion depth issues?
We cannot, Python explicitly doesn’t do TCO.
http://neopythonic.blogspot.com/2009/04/tail-recursion-elimination.html?m=1