
Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Find Permutation When Values n and r are Given in Java
Permutation refers a number of ways in which set members can be arranged or ordered in some fashion. The formula of permutation of arranging k elements out of n elements is −
nPk = n! / (n - k)!
Algorithm
1. Define values for n and r. 2. Calculate factorial of n and (n-r). 3. Divide factorial(n) by factorial(n-r). 4. Display result as a permutation.
Example
import java.util.Scanner; public class Permutation { static int factorial(int n) { int f; for(f = 1; n > 1; n--){ f *= n; } return f; } static int npr(int n,int r) { return factorial(n)/factorial(n-r); } public static void main(String args[]){ Scanner sc = new Scanner(System.in); System.out.println("Enter the value of n :"); int n = sc.nextInt(); System.out.println("Enter the value of r :"); int r = sc.nextInt(); System.out.println("npr value is ::"+npr(n,r)); } }
Output
Enter the value of n : 4 Enter the value of r : 3 npr value is ::24
Advertisements