Find output of recursive method

Question

I have to find the output, base case, recursive case, and depth of recursion of this method. I can't figure out how to find the output. This is the given method:

public int m5(int n){       //use n = 6 for initial n
         if(n>=3){
                n += m5(n-3);
                n += m5(n/2);
         }
         return n;
}

Sergio Peñafiel · Accepted Answer · 2021-10-11 03:18:43Z

1

Your algorithm does not converge. You can compute by hand the first 6 values of m5(x) which are:

But now take a look at the computation of m5(7) you will have to compute md5(7-3) = md5(4) = 7. Then after the sum n is 7 + 7 = 14. So in the next call you have to compute md5(14/2) = md5(7) but m5(7) is exactly what we are trying to compute so you have an infinity recursion.

answered Oct 11, 2021 at 3:18

Sergio Peñafiel

5365 silver badges17 bronze badges

Sign up to request clarification or add additional context in comments.

1 Comment

Dia Over a year ago

Thank you for the answer but how did you get the values of m5.

Collectives™ on Stack Overflow

Find output of recursive method

1 Answer 1

1 Comment

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

1 Comment

Your Answer

Sign up or log in

Post as a guest

Related