4 ms·
It's easy enough to convert by adding arguments for the two variables used in the iterative version: https://github.com/codr7/liblg/blob/master/bench/fibiter.p
by codr7 6y ago
It's easy enough to convert by adding arguments for the two variables used in the iterative version:
https://github.com/codr7/liblg/blob/master/bench/fibiter.py https://github.com/codr7/liblg/blob/master/bench/fibiter.py
https://github.com/codr7/liblg/blob/master/bench/fibtail.py https://github.com/codr7/liblg/blob/master/bench/fibtail.py
- tgv 6y agoThe point of recursion is not recursion, but a better way to write code. Better can be more readable, less errors, whatever, but adding two parameters to the Fibonacci function for the sake of introducing tail recursion, where even iteration is more understandable, is pointless.
- codr7 6y agoDepends, not all languages provide variables and since they're more or less equal it's a matter of preference in other cases.