Rosetta Code

Sorting algorithms/Permutation sort: Difference between revisions

← Older editNewer edit →
Content deleted Content added
Petelomax (talk | contribs)
7,833 edits
Trizen (talk | contribs)
2,756 edits
m →‎{{header|Sidef}}: minor code improvements
Line 1,439:
<lang ruby>func psort(x, d=x.end) {
 
if (d.is_zero) && ({
rangefor i in (1, .. x.end).each { |i|
(x[i] < x[i-1]) && return false;
}
return true;
);}
 
(d+1).times {
Line 1,455:
}
 
var a = 10.of { 100.rand.intirand };
say "Before:\t#{a}";
psort(a);
Retrieved from "https://rosettacode.org/wiki/Sorting_algorithms/Permutation_sort"