Permutations by swapping: Difference between revisions
Added Easylang
(Add Dart implementation) |
(Added Easylang) |
||
Line 1,526:
</pre>
=={{header|EasyLang}}==
<syntaxhighlight>
# Heap's Algorithm
numfmt 0 2
sig = 1
proc generate k . ar[] .
if k = 1
write sig & " "
sig = -sig
print ar[]
return
.
generate k - 1 ar[]
for i to k - 1
if k mod 2 = 0
swap ar[i] ar[k]
else
swap ar[1] ar[k]
.
generate k - 1 ar[]
.
.
ar[] = [ 1 2 3 ]
generate len ar[] ar[]
</syntaxhighlight>
{{out}}
<pre>
1 [ 1 2 3 ]
-1 [ 2 1 3 ]
1 [ 3 1 2 ]
-1 [ 1 3 2 ]
1 [ 2 3 1 ]
-1 [ 3 2 1 ]
</pre>
=={{header|EchoLisp}}==
| |||