Everything you need before the bell rings
Learning Objectives
Students will be able to…
- ✓Explain recursion.
- ✓Identify the base case.
- ✓Trace a recursive call.
- ✓Write a recursive function.
How can a function solve a problem by calling itself?
Understand Recursion
Project each item and have students answer about recursion.
55 minutes, five moves
Tap any phase to open the teacher moves and student actions.
Hook — Dolls Within Dolls
How do you open a stack of nesting dolls?
👩🏫 Teacher Moves
- Show nesting dolls.
- Ask about the smallest one.
- Set the goal.
🎒 Student Actions
- Look.
- Guess.
- Get ready.
Use — Recursion
Students use the idea.
👩🏫 Teacher Moves
- Send students to Understand Recursion.
- Note calls itself + base case.
- Trace factorial(3).
🎒 Student Actions
- Answer.
- Note it.
- Trace.
Modify — Trace It
Students modify.
👩🏫 Teacher Moves
- Expand factorial(3) step by step.
- Change the base case; see the effect.
- Spot an infinite recursion risk.
🎒 Student Actions
- Expand.
- Change.
- Spot.
Create — Write It
Students create.
👩🏫 Teacher Moves
- Write a recursive function (countdown).
- Give it a base case.
- Test a few inputs.
🎒 Student Actions
- Write.
- Base.
- Test.
Reflect — Reflect
Students close.
👩🏫 Teacher Moves
- Say what recursion is.
- Say why a base case matters.
- Complete the exit ticket.
🎒 Student Actions
- Say it.
- Say.
- Complete the exit ticket.
Built to the standards you report on
Aligned to the CSTA K-12 Computer Science Standards and the ISTE Standards for Students.
Iteratively develop programs using control structures.
Decompose problems into smaller same-shaped parts.
Use procedures to reduce complexity.
Decompose problems recursively.
One lesson, every learner
Multilingual Learners
- Use nesting dolls.
- Frame: “smaller, then smaller, then stop.”
- Trace with a picture.
Support & Access
- Use a 3-step countdown.
- Identify the stop case.
- Use a trace table.
Stretch & Extend
- Write recursive factorial.
- Compare recursion vs a loop.
- Draw the call stack.
What to gather
- 📽️Screen / board
- 🪆Nesting dolls
- 💻Understand Recursion
- 🐍Python / editor
- 📓Notebooks
- 🎫Exit-ticket slips
Key terms — hover for a quick definition
Exit Ticket
Preview the three formative checks. Tap “Sample answer” to see what mastery looks like — hide them before you print for students.
Reflect: recursion.
Have students describe a recursive function and its base case. A printable recursion worksheet is in the Computer Science library.
Study the key terms
Tap a card to flip it, then rate whether you knew it. Built from this lesson’s vocabulary.
Nice work!
Check your understanding
A quick self-check with instant feedback, drawn from this lesson’s key terms.
Nice work!
Printable worksheet
A print-and-go review sheet with a built-in answer key. Tap “Show answer key” to reveal answers, or print the clean version for students.
Part A · Write the word that matches each meaning
- break into a smaller same-shaped problem
- the step that calls itself on a smaller input
- a function that calls itself
- n * (n-1) * ... * 1 — a classic recursion
- no base case reached (a bug)
- pass a result back up the calls
- the input that stops the recursion
- the record of active function calls
Part B · Show what you learned
- What is a recursive function?
- What does a base case do?
- What does factorial(3) = 3 * factorial(2) show?
Part B: 1) One that calls itself on a smaller version of the problem. 2) Stops the recursion so it does not run forever. 3) Breaking a problem into a smaller same-shaped problem.