I am looking for a c++ or c version of a function that will implement N choose M.
i.e. set A= {a,b,c,d)
N=4
M=2
4 choose 2 from set A I get 6 total combos = N!/M!*(N-M)!
ab
ac
ad
bc
bd
cd
I tried to develop it using recursion, but I just don't see it.
Any help or pointers would be very helpful.
It is too clear and so it is hard to see.
A dunce once searched for fire with a lighted lantern.
Had he known what fire was,
He could have cooked his rice much sooner.
Are you trying to compute the probability (given random selection) or are you actually trying to generate the subsets?Originally Posted by kappajacko
