recursion
JavaScript
const factorial = n => {
return !n ? 1 : n * factorial(n-1);
}
const pow = (n, m) => {
return m === 1 ? n : n * pow(n, m - 1);
}
console.log(factorial(5));
console.log(pow(5, 2));
const factorial = n => {
return !n ? 1 : n * factorial(n-1);
}
const pow = (n, m) => {
return m === 1 ? n : n * pow(n, m - 1);
}
console.log(factorial(5));
console.log(pow(5, 2));