Sorting algorithms/Permutation sort: Difference between revisions

Content added Content deleted
m (→‎{{header|Sidef}}: minor code improvements)
Line 1,439: Line 1,439:
<lang ruby>func psort(x, d=x.end) {
<lang ruby>func psort(x, d=x.end) {


d.is_zero && (
if (d.is_zero) {
range(1, x.end).each { |i|
for i in (1 .. x.end) {
x[i] < x[i-1] && return false
(x[i] < x[i-1]) && return false;
}
}
return true;
return true;
);
}


(d+1).times {
(d+1).times {
Line 1,455: Line 1,455:
}
}


var a = 10.of { 100.rand.int };
var a = 10.of { 100.irand };
say "Before:\t#{a}";
say "Before:\t#{a}";
psort(a);
psort(a);