Question: Write a recursive method called permut that accepts two integers n and as parameters and returns the number of unique permutations of r items from

Write a recursive method called permut that accepts two integers n and as parameters and returns the number of unique permutations of r items from a group of n items. For given values of n and r, this value P(n, r) can be computed as follows:

n! P(n, r) = (п — г)!

For example, permut(7, 4) should return 840 . It may be helpful to note that permut(6, 3) returns 120 , or 840 / 7.

n! P(n, r) = ( )!

Step by Step Solution

3.40 Rating (169 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

public static int pe... View full answer

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 Building Java Programs A Back to Basics Approach Questions!