Tag: Permutations
-
Finds the longest ascending subsequence of a permutation.
-
Counts the number of breaks in a permutation.
-
Checks whether an array represents a permutation.
-
Counts the number of cycles in a permutation.
-
Verifies if a given permutation is a derangement.
-
Calculates the inverse of the given permutation.
-
Calculates the inverse of the given permutation.
-
Computes the inversion sequence of a permutation.
-
Computes the product of two permutations.
-
Computes the partition generated by the given permutation.
-
Progressively generates all the permutations of the given size.
-
Progressively generates all the permutations of the given size.
-
Progressively generates all the permutations of the given size.
-
Progressively generates all the permutations of the given size, in lexicographic order.
-
Computes the rank of the given permutation, as generated by Permutation Class 2.
-
Calculates the sign of the given permutation.
-
Computes the Ulam metric distance of two permutations.
-
Returns the permutation of the given rank, as generated by the Permutation Class 2 component.
-
Reports the unused items in a partial permutation.