Probablity algorithm for N choose M in C or C++

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.

google is your friend

Quote:

---

Originally Posted by kappajacko

I tried to develop it using recursion, but I just don't see it.

---

Are you trying to compute the probability (given random selection) or are you actually trying to generate the subsets?