Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math

Topic: Simple algorithm, to produce permutations of n
Replies: 19   Last Post: Jun 14, 2013 4:34 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Bergholt Stuttley Johnson

Posts: 38
Registered: 4/13/13
Re: Simple algorithm, to produce permutations of n
Posted: Jun 11, 2013 6:57 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

JT wrote:
>
> Is there a simple algorithm that can create the permutations on
> following form for n>0?


http://en.wikipedia.org/wiki/Steinhaus-Johnson-Trotter_algorithm

--
fix$(<$>)<$>(:)<*>((<$>((:[])<$>))(=<<)<$>(*)<$>(>>=)(+)($))$1



Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.