The formula for computing the number of ways of choosing r different things from a set of

Question:

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) %3D r!(n –r)! II

In this formula, the factorial function is represented by an exclamation point (!) and defined as the product:

n! = n × (n – 1) × (n – 2) × … × 1

Discover a recursive version of the C(n, r) formula, and write a recursive method that computes the value of the formula. Embed the method in a program and test it.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: