Recursion and stack

Question 1

A partial case of this is when a function calls itself. That’s called _______.

Answer 1

recursion

Question 2

function pow(x, n) {
let result = 1;
for (let i = 0; i < n; i++) {
result *= x;
}
return result;
}

write the above in a shorter way
function pow(x, n) {
/* coder here */
}

Answer 2

return (n == 1) ? x : (x * pow(x, n - 1));