2.2.1 Programming Techniques

Question 1

What are the 3 conditions for Recursion

Answer 1

1. Contains a stopping condition
2. For any input value other than the stopping condition, the subroutine should call itself
3. The stopping condition should be reachable within a finite number of time.

Question 2

Compare iteration and recursion, which is more memory efficient?

Answer 2

Iteration.

In recursive approach, every time a recursive function calls itself, the processor needs to remember where it was before it jumps to the new copy.
The processor also needs to remember that values of all the previous variables using stacks, which takes up space in memory.

Question 3

Define Sequence

Answer 3

A programming constructs that code is executed line by line.