Boost logo

Boost :

From: Peter Dimov (pdimov_at_[hidden])
Date: 2002-07-19 05:35:35

From: "Aleksey Gurtovoy" <agurtovoy_at_[hidden]>
> > No 'sort' algorithm?
> A few were contributed, but I wanted a quick sort (like the one you've
> posted a long time ago, but implemented in MPL terms), and never got to
> Feel free to contribute! ;)

The learning curve is too steep for me. A quicksort is simply

sort(S, P = less) :- sort(select(S: P(_1, S[0])), P) . sort(select(S: !P(_1,
S[0])), P)

but the 'MPL terms' step _appears_ to require considerable investment.
(Which is perhaps the biggest MPL problem; the implementation isn't easy to

A 'sort' implementation would make a good tutorial, BTW. :-)

Boost list run by bdawes at, gregod at, cpdaniel at, john at