[Programming] Proper Tail Recursion - Bypass recursion limit

[FernandoMorea]

To test the code try with:

myfact(10,1)
long({1,2,3},{4,5,6})

To continue to run the result you can either copy the last result from the top with the arrow key and run it with enter, or you can do:
eval(Ans)

- Or, better, you can write:
cont
After that, you can spam the enter key to run the continuation till the end of the algorithm (in the case of the factorial you have exactly n iteration, so if you wrote myfact(100,1) you should spam the enter key for 100 times, still not practical but it works).