Site Links
Question #1
Recursion can be thought of as a type of looping.
Question #2
Each recursive call removes data from the execution stack, and can result in a stack underflow
Question #3
All recursive algorithms must have an exit condition.
Question #4
Some things programmed using recursion cannot be programmed using loops.
Question #5
When a function calls itself, the instructions of the function are used again.