Sorting algorithms/Gnome sort: Difference between revisions
m
→{{header|Sidef}}: minor code simplifications
(First implementation in PL/I) |
m (→{{header|Sidef}}: minor code simplifications) |
||
Line 2,288:
while (i < len) {
if (self[i-1] <= self[i]) {
}
else {
if (--i == 0) {
}
}
}
return self;
}
Line 2,302:
var ary = [7,6,5,9,8,4,3,1,2,0];
say ary.gnomesort
{{out}}
<pre>[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]</pre>
| |||