Sorting algorithms/Permutation sort: Difference between revisions
Content added Content deleted
(Added EchoLisp) |
m (→{{header|Sidef}}: code simplifications) |
||
| Line 1,388: | Line 1,388: | ||
=={{header|Sidef}}== |
=={{header|Sidef}}== |
||
{{trans|Perl}} |
{{trans|Perl}} |
||
<lang ruby>func psort(x, d) { |
<lang ruby>func psort(x, d=x.end) { |
||
d.is_zero && ( |
|||
range(1, x.end).each { |i| |
range(1, x.end).each { |i| |
||
x[i] < x[i-1] && return false |
x[i] < x[i-1] && return false |
||
} |
} |
||
return true; |
return true; |
||
); |
); |
||
| Line 1,401: | Line 1,401: | ||
x[d] < x[d-1] && next; |
x[d] < x[d-1] && next; |
||
psort(x, d-1) && return true; |
psort(x, d-1) && return true; |
||
} |
} |
||
return false; |
return false; |
||