When the base case is met, which of these could be returned?

[Enclosing method: recursiveFunc(int n)]

The capabilities of a recursive function can typically be recreated by . . .

For which of these operations is a recursive function practical?

What is a recursive function?

Which of these is NOT an acceptable header for a recursive function?

Assuming n is initialized as an integer variable with a positive value, what will be printed?

The Collatz Conjecture states that, in sequence, taking any integer and, if even, halving the result/integer and, if odd, tripling and adding 1 to the result/integer continuously will eventually end up as 1.

Which of the above methods properly recreates the conjecture?

Select all answers that apply.

(Click the picture to enlarge.)

Which of the above methods correctly implements indirect recursion?

Select all answers that apply.

Which of the above methods correctly implements direct recursion?

Select all answers that apply.

Which of the above methods could result in a stack overflow exception for certain values of n?

Select all answers that apply.