Question: ANSWER IN C++ Write a recursive function that calculates the number of combinations of X items that can be made from Y items by using

ANSWER IN C++

Write a recursive function that calculates the number of combinations of X items that can be made from Y items by using the following formula:

Combinations (Y, X) =

Y if X = 1

1 if X = Y

(Combinations( Y-1, X-1) + 3* Combinations ( Y-1, X)) if Y > X > 1

Write a driver to print out the value for Combinations (5, 4) and Combinations (7, 5).

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!