recursive algorithm to determine C(n,r).

timer Asked: Jul 1st, 2015

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  

  1. Write a recursive algorithm to determine C(n,r).  Identify the base case(s) and the general case(s).

  2. Using your recursive algorithm, determine C(5,3) and C(9,4).

Tutor Answer

(Top Tutor) Studypool Tutor
School: UCLA
Studypool has helped 1,244,100 students
flag Report DMCA
Similar Questions
Hot Questions
Related Tags

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