Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Tail Recursion should be as faster as a while-loop, sometimes even faster because of internal compiler optimizations. If it's not the case then the developer has done something wrong. In the case of your code, the tail recursion version of
fac
the "slowness" of the implementation is caused by how you implementedfac
, which is different from the while example, and has nothing to do with tail recursion. I've attached to this email a screenshot of the score of my tail recursion implementation (ending with 2) to show that tail recursion is on pair with the while loop. I have only testedLong
because I don't have time for the other three tests but I'm fairly confident the result will be similar.