-
Notifications
You must be signed in to change notification settings - Fork 0
/
PermutationAndCombination.js
50 lines (46 loc) · 1.34 KB
/
PermutationAndCombination.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
/**
* @details Calculates the number of permutations and combinations.
* @external_link (Permutation And Combinations)[https://www.geeksforgeeks.org/permutation-and-combination/]
*/
/**
* @brief Calculates the factorial of the given number.
* @param num: integer
* @details Factorial of n = n * (n - 1) * (n - 2) * ... * 1
* @returns integer: Factorial of the number.
NaN: if negative number is provided.
*/
const factorial = (n) => {
if (n >= 0) {
if (n === 0) {
return 1
} else {
return n * factorial(n - 1)
}
} else {
return NaN
}
}
/**
* @brief Calculates the number of Permutations from the given data.
* @param
* n: integer -> number of items.
* r: integer -> number of times n is taken.
* @returns integer: The number of permutations.
NaN: if negative number is provided.
*/
const permutation = (n, r) => {
return factorial(n) / factorial(n - r)
}
/**
* @brief Calculates the number of Combinations from the given data.
* @param
* n -> number of items.
* r -> number of times n is taken.
* @returns integer: The number of combinations.
NaN: if negative number is provided.
*/
const combination = (n, r) => {
return factorial(n) / (factorial(r) * factorial(n - r))
}
// Exports the functions to be used in other files.
export { factorial, permutation, combination }