A recursive function calculates factorials. What happens if the base case (n=0) is omitted, causing infinite recursion?

💡 Explanation

Omitting the base case means that the function will call itself without ever stopping; recursion continues until available stack memory is exhausted, causing a stack overflow error, because the stack frame is pushed without end. Therefore, a stack overflow is the outcome, rather than returning a value, default or otherwise, or converging.

• What happens to the chromatic number of a directed acyclic graph when the number of nodes doubles?
• If an automated spam filter flags an email as suspicious, which consequence related to conditional probability follows?
• If a RSA cryptosystem uses a modulus `n` that is the product of two distinct large prime numbers, which advantage does Fermat's Little Theorem provide in checking primality?
• What happens to the connectivity of a sensor network when a malicious actor introduces a topological change by selectively disabling communication links?
• A system generates cryptographic keys using prime numbers. If the prime number generator malfunctions, consistently producing only numbers divisible by 3, which security outcome becomes most likely?
• Which outcome occurs when a manufacturing robot arm attempts to simultaneously grip and release an object based on contradictory sensor readings?