Can there be two base cases in a recursion?

Question

recursion

I solved the problem with recursion, but I had two base cases (two if s ). Is such a construction correct?

Answer 1

The instructor tricked you with the term "base case", there is no such term in common use (in recursion).
There can be any number of conditional statements (usually, at least one).
Correctness of the solution != optimality of the solution. Therefore, any code can be considered "correct" if it gives the correct solution to the problem, taking into account the terms of reference.