Revision as of 20:01, 27 July 2012 (view source) Rdm (talk \| contribs) m (→‎{{header\|J}}) ← Older edit		Revision as of 20:04, 27 July 2012 (view source) Rdm (talk \| contribs) m (→‎{{header\|J}}) Newer edit →
Line 15: =={{header\|J}}== J's has a built in mechanism for [http://www.jsoftware.com/help/dictionary/dacapdot.htm ~~generating~~representing permutations] (which is designed around the idea of selecting a permutation uniquely by an integer) but it does not seem seem to have an obvious mapping to Steinhaus–Johnson–Trotter. Perhaps someone with a sufficiently deep view of the subject of permutations can find a direct mapping? Meanwhile, here's an inductive approach, using negative integers to look left and positive integers to look right:

Permutations by swapping: Difference between revisions

Permutations by swapping (view source)