recursion

Question 1

state definition of recursion [1m]

Answer 1

procedure that calls itself and returns a predetermined value when base case is encountered

Question 2

3 conditions of recursive functions

Answer 2

• it should have at least one base case that returns a value directly without calling itself
• calls itself when base case is unmet
• each successive recursive call should reduce the input to bring it closer to the base case

Question 3

advantage of recursion

Answer 3

can be split among multiple processors (when func calls itself twice in one line, calc happen for both func calls simultaneously)

Question 4

disadvantage of recursive

Answer 4

greater overhead due to the need to push and pop function frames on and off the call stack (more time consumption in program execution)

Question 5

the call stack

Answer 5

• stack is a data structure that follows LIFO order
• the function frame contains all the variables in that instance of the recursive function
  when function is called:
• function frame is allocated for the function call and pushed onto the call stack
  when func call terminates:
• function frame is popped off the call stack

Question 6

difference btwn trace table & trace diagram? (visual)

Answer 6

hope u do! jiayou!
(check recursion notes if u dont)