Sorting algorithms/Cocktail sort: Difference between revisions
Added Easylang
(added RPL) |
(Added Easylang) |
||
Line 1,599:
}</syntaxhighlight>
Note that this solution contains no repeated code to handle the forward and reverse passes.
=={{header|EasyLang}}==
<syntaxhighlight>
proc sort . d[] .
a = 1
b = len d[] - 1
while a <= b
h = a
for i = a to b
if d[i] > d[i + 1]
swap d[i] d[i + 1]
h = i
.
.
b = h - 1
h = b
for i = b downto a
if d[i] > d[i + 1]
swap d[i] d[i + 1]
h = i
.
.
a = h + 1
.
.
l[] = [ 5 6 1 2 9 14 2 15 6 7 8 97 ]
sort l[]
print l[]
</syntaxhighlight>
{{out}}
<pre>
[ 1 2 2 5 6 6 7 8 9 14 15 97 ]
</pre>
=={{header|Eiffel}}==
| |||