Type:

Other

Description:

The ... permutations of the set ... are generated here by starting with this set and successively applying ... transpositions. At each step the largest element ... moves back and forth across the other elements, pausing for one step at each end. In the pauses the other elements also move back and forth and also pause. This sequence of permutations can be generated by the Johnson–Trotter algorithm. The list of transpositions used here is constructed by recursion.

Subjects:

    Education Levels:

      Keywords:

      EUN,LOM,LRE4,work-cmr-id:398660,http://demonstrations.wolfram.com:http://demonstrations.wolfram.com/GeneratingPermutationsByASequenceOfTranspositions/,ilox,learning resource exchange,LRE metadata application profile,LRE

      Language:

      Access Privileges:

      Public - Available to anyone

      License Deed:

      Creative Commons Attribution 3.0

      Collections:

      None
      This resource has not yet been aligned.
      Curriki Rating
      'NR' - This resource has not been rated
      NR
      'NR' - This resource has not been rated

      This resource has not yet been reviewed.

      Not Rated Yet.

      Non-profit Tax ID # 203478467