Anonymous user
Permutations by swapping: Difference between revisions
More clear?
(More clear?) |
|||
Line 1:
{{draft task}}
Generate permutations of n items
Such data are of use in generating the [[Matrix arithmetic|determinant]] of a square matrix and any functions created should bear this in mind.
Note: The Steinhaus–Johnson–Trotter algorithm generates successive permutations where ''adjacent'' items are swapped, but from [[wp:Parity_of_a_permutation#Example|this]] discussion adjacency is not a requirement.
;References:
|