Sorting algorithms/Permutation sort: Difference between revisions

Nimrod -> Nim
m (→‎{{header|REXX}}: added whitespace and comments, remove an unneeded statement.)
(Nimrod -> Nim)
Line 873:
Warning: This algorithm is very inefficient and Max will crash very quickly with bigger arrays.
 
=={{header|NimrodNim}}==
<lang nimrodnim>iterator permutations[T](ys: openarray[T]): seq[T] =
var
d = 1
Anonymous user