Tag Archives: ringing

The Steinhaus-Johnson-Trotter algorithm

Posted on January 3, 2013 by Brent

In a previous post I posed the question: is there a way to list the permutations of in such a way that any two adjacent permutations are related by just a single swap of adjacent numbers? (Just for fun, let’s … Continue reading →

Posted in combinatorics, pattern, solutions | Tagged , , , , , | 9 Comments