recursive algorithum

Question

Examine the following recursive method.
public int mystery(int x, int y)
{
if (x < y)
{ return 0; }
else
{ return 1 + mystery(x – y, y); }
}
(a) State the value of variable w after
(i) int w = mystery(2, 3); [1 mark]
(ii) int w = mystery(2, 2); [1 mark]
(iii) int w = mystery(7, 3). [1 mark

Answer 1

Dear Aa (the lava type??) this is ust a plug-in type problem

(i) returns 0

(ii) returns 1 + mystery(0.2) [0 recursions] = 1 [1 recursion]

(iii) returns 1+ mystery(4,3) [0 recursions] = 2 + mystery(1.3) [1 recursion] = 2 [2 recursions]

I don't understand the designation "[1 mark]", but if it means after 0, 1 , or 2 recursions you should be able to sort it out from the above. You should investigate the properties of this function; it's a form of quantitating integer_round_down(y/x) as integer values, or some such, but without using the division function. -- Regards,Stan de Riel