GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — JavaScript/Recursive/Factorial.js at master · TheAlgorithms/JavaScript Expand file tree/ Copy pathFactorial.jsMore file actions 23 lines (19 loc) · 524 Bytes / Copy pathFactorial.jsFile metadata and controls23 lines (19 loc) · 524 Bytes 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 /** * @function Factorial * @description function to find factorial using recursion. * @param {Integer} n - The input integer * @return {Integer} - Factorial of n. * @see [Factorial](https://en.wikipedia.org/wiki/Factorial) * @example 5! = 1*2*3*4*5 = 120 * @example 2! = 1*2 = 2 */ const factorial = (n) => { if (!Number.isInteger(n) || n < 0) { throw new RangeError('Input should be a non-negative whole number') } if (n === 0) { return 1 } return n * factorial(n - 1) } export { factorial } |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |