recursion week

Question 1

recursion

Answer 1

process of calling a function that is currently executing

Question 2

recursive fucntion

Answer 2

a function that calls itself to solve a problem

Question 3

base case

Answer 3

a conditional branch in a recursive function that does not make a recursive call

Question 4

mathematical induction

Answer 4

a function P(n) can be proved true by proving the basis (that P(1) is true) and the inductive (showing that p(k) is true if P(k - 1) is true)

Question 5

propositional function

Answer 5

a function P(x) that returns true or dalse depending on the value of x

Question 6

Euclids algorithm for greatest common divisor

Answer 6

if b=0 GCD is a
else the GCD is the GCD of b and the remainderr from dividing a by b
where a and b are positive ints

Question 7

when to use recursion

Answer 7

when it significantly simplifies the implementation and has no significant impact on the run time