Search the courses, subjects, tracks, games and features, or jump straight to a page.
4 cards from this section. Quick, good the night before a test.
Define recursion in your own words.
Think about how this relates to breaking problems into smaller parts.
What is the base case in a recursive function?
Recall examples where recursion can continue until a condition is met.
What is recursion?
Think about the key characteristic of recursion.
True or False: Every recursive function must have a base case.
Remember how recursion stops.
Design a recursive function that reverses a string.
Think about how to handle the end of the string to build it backwards.
Create a recursive function that counts down from a given number to zero.
Consider how the countdown should stop at zero.
6 more questions in this section. Enroll free to practise them all.
Enroll free