Answer
Generated with GPT-4o, contributed by Divoly library.
Recursion is when a function calls itself to solve smaller instances of the same problem. Here's a classic example with factorial:
```python def factorial(n): if n <= 1: # base case return 1 return n * factorial(n - 1) # recursive call
print(factorial(5)) # Output: 120 ```
Every recursive function needs: 1) A **base case** (to stop), and 2) A **recursive case** (to reduce the problem). Without a base case, you get infinite recursion and a stack overflow.
Keep exploring
Quantum entanglement is when two particles become correlated so that measuring one instantly determines the state of the other — no matter how far apart they are. **Simple analogy...
Sleep plays a critical role in **memory consolidation** — the process of moving information from short-term to long-term memory. **During sleep:** - **Slow-wave (deep) sleep:** Th...
Both are individual retirement accounts with tax advantages, but the timing of the tax break differs: **Traditional IRA:** - Contributions may be **tax-deductible** (reduces taxab...
Big O notation describes how an algorithm's time or space requirements grow as input size (n) grows. It gives an upper bound on complexity. **Common complexities (best → worst):**...
SQL JOINs combine rows from two tables based on a related column. Given: **users** (id, name) and **orders** (id, user_id, product) **INNER JOIN** — only rows that match in both ...
A derivative measures the **instantaneous rate of change** of a function — how fast the output is changing at a specific point. **Intuition:** Imagine driving a car. Your position...