When Recursive Methods Directly Call Themselves, It Is Known as This

Q1: Recursion is never absolutely required to solve

Q9: A method is called from the main

Q10: Any problem that can be solved recursively

Q11: Without a base case, a recursive method

Q14: Recursion can be a powerful tool for

Q15: In the _, we must always reduce

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