-1

I am working on a quiz for a computer science course. I would like to check that the following statement is false:

A recursive call may never generate more than one recursive call for the recursion to terminate

We have put this statement as false and I would like you to confirm that it is false. In almost all cases it is false, isn't it?

  • 4
    See this question: True or false about recursion. :-) – user949300 Sep 8 '18 at 23:28
  • 1
    Consider the classic (and inefficient) recursive fibonacci also: f(n) { return n <= 1 ? n : f(n-1) + f(n-2); }. – Erik Eidt Sep 9 '18 at 15:33
4

Yes, this is false.

Think about how recursive operations might behave in a binary tree for example.

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.