Question
IN JAVA!!!! Repeat all of the instructions from Exercise #1 (see them at bottom), except compute the number of combinations, given integers n and r.
IN JAVA!!!!
Repeat all of the instructions from Exercise #1 (see them at bottom), except compute the number of combinations, given integers n and r. Name your new method combination( ).
Combination Formula:
C(n,r)= n!/ r!(n-r)!
Exercise 1:
Write a method named permutation( ) that calculates the number of permutations for given n and r values.
Permutation formula:
P(n,r)= n!/(n-r)!
Note:
n! = n * (n-1) * (n-2) * * 1
0! = 1
Tip: It will be helpful to create a separate factorial( ) method and call this method within your
permutation( ) method. (Only call factorial( ) in permutation( ). Do not call factorial( ) in main.)
Test your implementation on:
n = 5 n = 5 n = 5 n = 5
r = 0 r = 2 r = 4 r = 5
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started