TERM 1
Problem Size
DEFINITION 1
The number of subproblems a particular recursion problem
possesses.
TERM 2
Base Case
DEFINITION 2
A case of arecursivedefinition that is not defined in terms of
itself.
TERM 3
Reduction
DEFINITION 3
A transformation of one problem into another problem.
TERM 4
Stack Overflow Error
DEFINITION 4
Occurs when too much memory is used on the call stack. The
call stack contains a limited amount of memory, often
determined at the start of the program.
TERM 5
List
DEFINITION 5
A sequential data structure. Additions and removals can be
made to any part of the list.
