- Home >
- Computer Science >
- recursive algorithm to determine C(n,r).
recursive algorithm to determine C(n,r).
Question Description
Suppose C(n,r) denotes the number of ways r different things can be chosen from a set of n items. Then C(n,r) is given by the following formula:
where the exclamation point denotes the factorial function. Moreover, It is known that
Write a recursive algorithm to determine C(n,r). Identify the base case(s) and the general case(s).
Using your recursive algorithm, determine C(5,3) and C(9,4).
This question has not been answered.
Create a free account to get help with this and any other question!
Similar Content
Cant Hurt Me - Master Your Mind and Defy the Odds
by David Goggins
The Catcher in the Rye
by J. D. Salinger
Pachinko
by Min Jin Lee
The Sun Is Also a Star
by Nicola Yoon
The Trial
by Franz Kafka
Moby Dick
by Herman Melville
The House of the Seven Gables
by Nathaniel Hawthorne
Communist Manifesto
by Karl Marx
The Mayor of Casterbridge
by Thomas Hardy
Studypool values your privacy. Only questions posted as Public are visible on our website.
Brown University
1271 Tutors
California Institute of Technology
2131 Tutors
Carnegie Mellon University
982 Tutors
Columbia University
1256 Tutors
Dartmouth University
2113 Tutors
Emory University
2279 Tutors
Harvard University
599 Tutors
Massachusetts Institute of Technology
2319 Tutors
New York University
1645 Tutors
Notre Dam University
1911 Tutors
Oklahoma University
2122 Tutors
Pennsylvania State University
932 Tutors
Princeton University
1211 Tutors
Stanford University
983 Tutors
University of California
1282 Tutors
Oxford University
123 Tutors
Yale University
2325 Tutors