Cycles of a permutation: Difference between revisions

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.

struct Perm

a::Vector{Int}

 

testAlfBettyPerms()

<pre>

On Thursdays Alf and Betty should rearrange

=={{header|Phix}}==

{{trans|Wren}}

<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span>

<span style="color: #7060A8;">requires</span><span style="color: #0000FF;">(</span><span style="color: #008000;">"1.0.2"</span><span style="color: #0000FF;">)</span> <span style="color: #000080;font-style:italic;">-- (tagstart)</span>

<span style="color: #008080;">if</span> <span style="color: #000000;">i</span><span style="color: #0000FF;">>=</span><span style="color: #000000;">9</span> <span style="color: #008080;">then</span> <span style="color: #7060A8;">printf</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"\n"</span><span style="color: #0000FF;">)</span> <span style="color: #008080;">end</span> <span style="color: #008080;">if</span>

<span style="color: #008080;">end</span> <span style="color: #008080;">for</span>

Output identical to Julia/Wren

 

=={{header|Python}}==

{{trans|Julia}}

 

from math import lcm # in python 3.9+

SPE = permutestring(SPE, PFRI)

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

<pre>

Same as Quackery.

=={{header|Quackery}}==

 

--------

echo sp

friday cycle cypermute dup echo$ cr ]

 

{{out}}

 

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

import "./fmt" for Fmt

 

prev = PC.cyclePermute(prev, cycles3)

System.print(prev)

 

{{out}}