kappajacko
Newbie level 3
Does anyone have an algorithm that creates all the possiblities an N choose M.
i.e. given a set of a b c d; 4 choose 2 gives me:
ab
ac
ad
bc
bd
cd
I can't seem to get this. I was trying to use recursion, but I can't see it...
i.e. given a set of a b c d; 4 choose 2 gives me:
ab
ac
ad
bc
bd
cd
I can't seem to get this. I was trying to use recursion, but I can't see it...