Re:Recursive fibonacci benchmark using top languages on GitHub
by Jtsummers on Friday September 28, 2018 @12:25PM
(#18094641)
Pretend you're a compiler, what changes would you make to this to make it tail recursive:
Rules: Making a second function (fib_help) is permitted. Shouldn't use any more memory than this one uses.
[ Parent
| on HN ]
Re:Recursive fibonacci benchmark using top languages on GitHub
by FeepingCreature on Friday September 28, 2018 @02:15PM
(#18095639)
Fun challenge.
https://paste.pound-python.org/show/m403qNkpS5I8dnYjJGJq/
I wanna see the compiler that gets that.