Sorting algorithms/Cocktail sort: Difference between revisions
Sorting algorithms/Cocktail sort (view source)
Revision as of 17:30, 24 February 2013
, 11 years agoAdded Forth version
(Added Forth version) |
|||
Line 540:
</pre>
=={{header|Forth}}==
<lang forth>defer precedes ( addr addr -- flag )
\ e.g. ' < is precedes
: sort ( a n --)
1- cells bounds 2>r false
begin
0= dup
while
2r@ ?do
i @ i cell+ @ over over precedes ( mark unsorted )
if drop drop else i ! i cell+ ! dup xor then
1 cells +loop
0= dup
while
2r@ swap 1 cells - ?do
i @ i cell+ @ over over precedes ( mark unsorted )
if drop drop else i ! i cell+ ! dup xor then
-1 cells +loop
repeat then drop 2r> 2drop
;</lang>
=={{header|Fortran}}==
{{works with|Fortran|90 and later}}
| |||