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 - / ).')
The factorial function n! is defined by
n! = n* (n-1) * (n - 2) *...*!
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.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.