Cycles of a permutation: Difference between revisions

Line 131:

is therefore customizable in the code below so as to fit to either format, and the test function's code is specified so as to

duplicate the cycles as written in examples given in the task.

<~~lang~~ julia>""" A Perm is a permutation in one-line form. `a` is a shuffled gapless 1-based range of Int. """

<syntaxhighlight lang="julia">""" A Perm is a permutation in one-line form. `a` is a shuffled gapless 1-based range of Int. """

struct Perm

a::Vector{Int}

Line 272:

testAlfBettyPerms()

</~~lang~~> {{out}}

</syntaxhighlight> {{out}}

<pre>

On Thursdays Alf and Betty should rearrange

Line 340:

=={{header|Phix}}==

with javascript_semantics

requires("1.0.2") -- (tagstart)

Line 546:

if i>=9 then printf(1,"\n") end if

end for

Output identical to Julia/Wren

=={{header|Python}}==

<~~lang~~ python>""" For Rosetta Code task Cycles_of_a_permutation """

<syntaxhighlight lang="python">""" For Rosetta Code task Cycles_of_a_permutation """

from math import lcm # in python 3.9+

Line 706:

SPE = permutestring(SPE, PFRI)

print(str(i+1).rjust(2), ' ', SPE, '\n' if i == 8 else '')

</~~lang~~> {{out}}

</syntaxhighlight> {{out}}

<pre>

Same as Quackery.

Line 713:

=={{header|Quackery}}==

<~~lang~~ ~~Quackery~~>( Glossary

<syntaxhighlight lang="quackery">( Glossary

--------

Line 1,079:

echo sp

friday cycle cypermute dup echo$ cr ]

drop</~~lang~~>

drop</syntaxhighlight>

Line 1,155:

I've also stuck rigidly to the Quackery entry's examples for ease of comparison.

<~~lang~~ ecmascript>import "./math" for Int

<syntaxhighlight lang="ecmascript">import "./math" for Int

import "./fmt" for Fmt

Line 1,395:

prev = PC.cyclePermute(prev, cycles3)

System.print(prev)

}</~~lang~~>

}</syntaxhighlight>