Sorting algorithms/Quicksort: Difference between revisions

(add Forth)
Line 35:
: exch ( addr1 addr2 -- ) dup @ >r over @ swap ! r> swap ! ;
: partpartition ( l r -- l r r2 l2 )
2dup mid @ >r ( r: pivot )
2dup begin
Line 44:
: qsort ( l r -- )
partpartition swap rot
\ 2over 2over - + < if 2swap then
2dup < if recurse else 2drop then
Anonymous user