In the ________, We Must Always Reduce the Problem to a Smaller

Q1: Recursion is never absolutely required to solve

Q9: A method is called from the main

Q11: Without a base case, a recursive method

Q13: The recursive case does not require recursion

Q14: When recursive methods directly call themselves, it

Q14: Recursion can be a powerful tool for

Q17: The _ is at least one case

Q19: The recursive binary search algorithm is a

Q19: The number of times that a method

Q23: A method that calls itself is a