Search the courses, subjects, tracks, games and features, or jump straight to a page.
3 cards from this section. Quick, good the night before a test.
Define recursion in your own words.
Think of functions that repeat.
What is the base case in a recursive function?
It's the stopping point.
What is the primary advantage of using recursion?
Consider how recursion relates to solving problems.
True or False: Every recursive function must have a base case.
Think about what would happen without limits in math.
Create a recursive function that finds the maximum value in a nested list.
Think about how to break the problem down.
Write a recursive function to reverse a string.
Break the string down to build it back up.
5 more questions in this section. Enroll free to practise them all.
Enroll free