Recursion base casesCore ideaEasy
Question
What two obligations make a recursive algorithm terminate?
Try to say the answer and your reasoning before revealing the card.
Student Review Tool
Computer science and math decks, searchable by topic, with easy, medium, and hard cards.
Step 1
Advanced Topics in CS
Recursion, runtime, linked structures, maps, trees, heaps, graphs, and algorithm design.
Question
Try to say the answer and your reasoning before revealing the card.
All decks included