Data-Structures-and-Algorithms/Permutation Coefficient at master · shoaibrayeen/Data-Structures-and-Algorithms · GitHub

Name		Name	Last commit message	Last commit date
parent directory ..
code_1.cpp		code_1.cpp
code_2.cpp		code_2.cpp
code_3.cpp		code_3.cpp
code_4.cpp		code_4.cpp
code_5.cpp		code_5.cpp
readMe.md		readMe.md

readMe.md

Permutation refers to the process of arranging all the members of a given set to form a sequence. The number of permutations on a set of n elements is given by n! , where “!” represents factorial.

The Permutation Coefficient represented by P(n, k) is used to represent the number of ways to obtain an ordered subset having k elements from a set of n elements.