Sorting algorithms/Comb sort: Difference between revisions
Added Easylang
m (→{{header|Wren}}: Minor tidy) |
(Added Easylang) |
||
Line 1,290:
[0 1 2 3 4 5 6 7 8 9]
</pre>
=={{header|EasyLang}}==
<syntaxhighlight>
proc combsort . d[] .
gap = len d[]
while gap > 1 or swaps = 1
gap = higher 1 (gap div 1.25)
swaps = 0
for i = 1 to len d[] - gap
j = i + gap
if d[i] > d[j]
swap d[i] d[j]
swaps = 1
.
.
.
.
d[] = [ 88 18 31 44 4 0 8 81 14 78 20 76 84 33 73 75 82 5 62 70 ]
combsort d[]
print d[]
</syntaxhighlight>
{{out}}
<pre>
[ 0 4 5 8 14 18 20 31 33 44 62 70 73 75 76 78 81 82 84 88 ]
</pre>
=={{header|Eiffel}}==
<syntaxhighlight lang="eiffel">
| |||