Welcome to the Java Programming Forums

The professional, friendly Java community. 21,500 members and growing!

The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.

>> REGISTER NOW TO START POSTING

# Thread: How to create this recursive method.

1. ## How to create this recursive method.

I need to write a function which, taking a positive integer n as input,
and finds all sets of numbers that sum up to n.
For example, n=4, the printing result will be:
4
3,1
2,2
2,1,1
1,1,1,1

--- Update ---

3. ## Re: How to create this recursive method.

Originally Posted by Norm
My method so far.
Still working on it.

public class JavaApplication1 {

public static void main(String[] args) {

sum(1,0,4);
}

public static void sum(int now,int remainder, int sum ){

System.out.println(remainder);

if (now == sum)
return;

if (remainder == sum)
{
remainder = 0;
sum(now++,remainder,sum);
return;
}
else{
sum(now,remainder++,sum);
return;
}
}
}

4. ## Re: How to create this recursive method.

My method so far.

package javaapplication1;

/**
*
* @author Gordon
*/
public class JavaApplication1 {

/**
* @param args the command line arguments
*/
public static void main(String[] args) {
// TODO code application logic here
sum(1,0,4);
}

public static void sum(int now,int remainder, int sum ){

System.out.println(remainder);

if (now == sum)
return;

if (remainder == sum)
{
remainder = 0;
sum(now++,remainder,sum);
return;
}
else{
sum(now,remainder++,sum);
return;
}
}
}