This week's book giveaway is in the Java 8 forum.
We're giving away four copies of Java 8 in Action and have Raoul-Gabriel Urma, Mario Fusco, and Alan Mycroft on-line!
See this thread for details.
The moose likes Beginning Java and the fly likes Recursive method Big Moose Saloon
  Search | Java FAQ | Recent Topics | Flagged Topics | Hot Topics | Zero Replies
Register / Login


Win a copy of Java 8 in Action this week in the Java 8 forum!
JavaRanch » Java Forums » Java » Beginning Java
Bookmark "Recursive method" Watch "Recursive method" New topic
Author

Recursive method

Stephanie Dears
Ranch Hand

Joined: May 26, 2005
Posts: 43
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
Ulf Dittmer
Marshal

Joined: Mar 22, 2005
Posts: 39578
    
  27
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 ]

Ping & DNS - updated with new look and Ping home screen widget
 
I agree. Here's the link: http://aspose.com/file-tools
 
subject: Recursive method
 
Similar Threads
problem with java code
TIJ 3 problem at simpeltest
trouble with operator
exponent loop w/out math .pow.
equals method .. comparing objects