The formula for computing the number of ways of choosing r different
things from a set of n things is the following:
C(n, r) = n!/(r!*(n – r)!)
The factorial function n! is defined by
n! = n*(n – 1)*(n – 2)*. . .*1
Discover a recursive version of this formula and write a recursive function
that computes the value of the formula. Embed the function in a program
and test it.
Sorry the answer is not available at the moment…
If you are able to find the answer, please make sure to post it here. So that your Juniors have smile on their lips and feel happy.
Spread the 'tradition of sharing'.