Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I wanted to see the impact of tail recursion optimization and want to write simple factorial function in a tail recursion optimized way.
Is it possible to do this in the code without compiler supporting it?
The compiler does the optimization. So it is not possible to test it without compiler support.
The only way to do this in code is to replace the recursion by iteration (but then of course you lose the recursion).