Sorting algorithms/Heapsort: Difference between revisions

Fixed bug in siftDown
(Added Forth)
(Fixed bug in siftDown)
Line 475:
dup 2* 1+ dup r'@ < ( s r c f)
while ( s r c)
dup 1+ dup r'@ < -rot ( s r f c c+1 f)
overif over r@ precedes ( s r f c c+1 f)
over over r@ precedes if swap then
>r rot r> and ( s r c c+1 f)
if swap then drop ( s r c|c+1)
over over r@ precedes ( s r c f)
while ( s r c)
Line 511:
 
.array example 10 heapsort .array </lang>
 
=={{header|Haskell}}==
Using package [http://hackage.haskell.org/package/fgl fgl] from HackageDB
Anonymous user