💡 Concept Explainer
A hard concept explained at the right level — analogy, step-by-step, example and a check.
See the quality — a real example
Sample only · no credits usedInput — concept & level
Explain 'recursion' to a first-year programming student who knows loops but finds recursion confusing.
Output — explanation
In one line
Recursion is a function that solves a big problem by calling itself on a smaller piece — until the piece is tiny enough to answer directly.
An analogy you already know
You're in a queue but can't see your position. So you ask the person ahead: “what's yours?” They ask the person ahead of them… until the front says “I'm #1.” Each answer +1 flows back to you. That hand-back is the base case + return.
Check yourself
What happens if there's no front of the queue? (→ infinite recursion — that's why every recursion needs a base case.)
Starts from what the student already knows (loops, queues) and ends with a self-check — calibrated to the exact level you state.
Sign in to use this tool
Sign in to use (30 free points on signup). Signed-in users run every tool on their account points — nothing to paste.
Sign in →