Ononot — If a recursive function f(n) is defined without a base case,

Guest Session: 1 Question Remaining. Create Account to save progress.

Recursioneasy

0:00.0

If a recursive function $f(n)$ is defined without a base case, what is the most likely outcome when attempting to compute $f(n)$ for any $n$ ?