#20 algorithm analysis and recursion

Question 1

upper bound

Answer 1

big - O

Question 2

lower bound

Answer 2

big - Omega

Question 3

exact bound (both lower and upper)

Answer 3

big - theta

Question 4

recursion

Answer 4

strategy for solving problems, method calls itself

Question 5

properties of recursion

Answer 5

relies on runtime call stack

any problem solvable with recursion can be solved with iteration and vice versa

Question 6

base case

Answer 6

the last step of the recursive call, makes it stop calling itself