Sorting algorithms/Quicksort: Difference between revisions

Content added Content deleted
Line 282: Line 282:
[[swap] dip cons concat]
[[swap] dip cons concat]
binrec .
binrec .

=={{header|Lucid}}==
qsort(a) = if eof(first a) then a else follow(qsort(b0),qsort(b1)) fi
where
p = first a < a;
b0 = a whenever p;
b1 = a whenever not p;
follow(x,y) = if xdone then y upon xdone else x fi
where
xdone = iseod x fby xdone or iseod x;
end;
end


=={{header|MAXScript}}==
=={{header|MAXScript}}==