i want to try and solve this question..

[alex lotel]

i need to constract a method which gets the two numbers
"n" and "k"
and prints all the avaible subgroops in "k size"
for example :

subsetofsize(4,2)
prints

12
41
13
32
42
34

i know i should use this recursion of subsets
i need to change it some how
i know how it works but i dont have any clue of how to change it
in order to get the resolt i was asked in the question

Public static void partitions (int n)
{
partitions (n, n, "");
}
Public  static void partitions (int n, int max, String prefix)
{
if(n==0)
{
System.out.println(prefix);
}
else
{
for(int i= Math.min(n,max); i>=1, i--)
{
partitions (n-i, i, prefix+" "+i);
}
}
}

[Joe Ess]

Please do not post the same question more than once. It causes confusion and duplication of effort as the community tries to help everyone.

[Campbell Ritchie]

Joe, can I suggest you delete this thread and transfer the original thread from Intermediate over here?

[alex lotel]

you said that i should go to the begginer forum with that question

thats what i did

didnt mean to cause any inconvinience