How JavaScript uses recursion to define factorial functions

JavaScript how to use recursion to define factorial functions, I believe that many inexperienced people do not know what to do, so this paper summarizes the causes of the problem and solutions, through this article I hope you can solve this problem.

If the function has a name, and the name will not change in the future, then the definition will be fine. The problem, however, is that the execution of the function is tightly coupled to the function name factorial.

1. To eliminate tight coupling, you can use arguments.callee.

2. In the rewritten factorial () function, the function name factorial is no longer referenced. The name used ensures the normal completion of the recursive call.

Example

Var trueFactorial = factorial;factorial = function () {return 0;}; alert (trueFactorial (5)); / / 120alert (factorial (5)); / / 0 after reading the above, have you mastered how JavaScript uses recursive methods to define factorial functions? If you want to learn more skills or want to know more about it, you are welcome to follow the industry information channel, thank you for reading!