Recursion Flashcards
1
Q
Base case
A
At some point a recursive algorithm must describe how to actually do something known as base case
2
Q
What is the recursive step
A
When the function calls itself
3
Q
What is a recursive helper function
A
Separate function (usually ) the same name. That does the recursion
