Recursive techniques

Question 1

Define Recursion

Answer 1

Ability of subroutine to call itself

Question 2

What does a recursive call use

Answer 2

Stack and Stack Frames to store the data from each depth of function call

Question 3

What must be in a recursive algorithm

Answer 3

Define a base case
Define the general case
Base case will always be reached
Must stop calling itself^^
(otherwise will only stop when all available memory is used)

Question 4

Recursion Advantages

Answer 4

Has fewer steps (easier for humans to read)

Natural way to process data structures

Question 5

Recursion Disadvantages

Answer 5

Harder to trace
Uses more memory (stack frames)
Slower (need to manage stack operations)