posted 12 years ago

How do determine the recursive formula?

I have the following code that I need to rewrite into a recursive method:

I understand this code, and I understand the theory of recursion. I even understand the factorial and Fibonacci recursion code. But I'm dealing with two sets of numbers here and I'm confused.

Steph

I have the following code that I need to rewrite into a recursive method:

I understand this code, and I understand the theory of recursion. I even understand the factorial and Fibonacci recursion code. But I'm dealing with two sets of numbers here and I'm confused.

Steph

posted 12 years ago

This sounds like homework of some kind.

Recursion works by reducing a problem to a simpler problem of the same kind. What you need to do is reduce intDiv(n1, n2) to intDiv(n1-n2, n2), and terminate as appropriate.

Is it the fact that two numbers are involved that confuses you? That should be familiar if you have programmed Fibonacci recursively. Another example you could study is Euclid's GCD algorithm.

[ January 01, 2006: Message edited by: Ulf Dittmer ]

Recursion works by reducing a problem to a simpler problem of the same kind. What you need to do is reduce intDiv(n1, n2) to intDiv(n1-n2, n2), and terminate as appropriate.

Is it the fact that two numbers are involved that confuses you? That should be familiar if you have programmed Fibonacci recursively. Another example you could study is Euclid's GCD algorithm.

[ January 01, 2006: Message edited by: Ulf Dittmer ]

It is sorta covered in the JavaRanch Style Guide. |