recursiveFactorial.js

// factorial (imperitive)
const factorial = n => {
	let result = 1;
	while (n > 1) {
		result *=n;
		n--;
	}
	return result;
};

// factorial (declarative)
const factorial = (n,accum=1) => {
	if (n < 2) {
		//return 1; // base case (prevents infinite loop)
		return accum;
	}
	//return n * factorial(n - 1); 
	return factorial(n - 1, n * accum); // putting factorial() last in order of operations (tail-call)
}