Consider the following recursive method. public static int rec(int x) { if(x < 3){ return 0; } if (x < 20){ return 1 + rec (x-10) + xec (x-5); } return x+rec (x-10); How many times is the method zec () called then initially called as rec (21)? Include the initial call.

C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter15: Recursion
Section: Chapter Questions
Problem 8SA
icon
Related questions
Question

49, question is in java, thanks

Consider the following recursive method.
public static int rec(int x) {
if (x < 3){
return 0;
}
if (x < 20){
return 1+rec (x−10) + rec (x-5);
}
return x + rec (x-10);
How many times is the method rec() called then initially called as rec (21)?
Include the initial call.
A/
Transcribed Image Text:Consider the following recursive method. public static int rec(int x) { if (x < 3){ return 0; } if (x < 20){ return 1+rec (x−10) + rec (x-5); } return x + rec (x-10); How many times is the method rec() called then initially called as rec (21)? Include the initial call. A/
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Time complexity
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning