Sorting algorithms/Stooge sort: Difference between revisions
m
→{{header|EasyLang}}
imported>Arakov |
|||
(3 intermediate revisions by 3 users not shown) | |||
Line 700:
</pre>
=={{header|EasyLang}}==
<syntaxhighlight>
proc stsort left right . d[] .
if d[left] > d[right]
swap d[left] d[right]
.
if right - left + 1 > 2
t = (right - left + 1) div 3
stsort left right - t d[]
stsort left + t right d[]
stsort left right - t d[]
.
.
for i = 1 to 100
d[] &= randint 1000
.
stsort 1 len d[] d[]
print d[]
</syntaxhighlight>
=={{header|Eiffel}}==
Line 804 ⟶ 824:
public program()
{
var list := new Range(0, 15).selectBy::(n => randomGenerator.nextInt(20)).toArray();
console.printLine("before:", list.asEnumerable());
Line 2,521 ⟶ 2,541:
=={{header|Wren}}==
<syntaxhighlight lang="
stoogeSort = Fn.new { |a, i, j|
if (a[j] < a[i]) {
Line 2,536 ⟶ 2,556:
}
var
for (a in
System.print("Before: %(a)")
stoogeSort.call(a, 0, a.count-1)
|