[Haskell-cafe] Re: excercise - a completely lazy sorting
matthias.goergens at googlemail.com
Tue Jul 7 03:49:09 EDT 2009
> So, a tree like Matthias implements it is the way to go. Basically, it
> reifies the recursive calls of quicksort as a lazy data struture which
> can be evaluated piecemeal.
Yes. I wonder if it is possible to use a standard (randomized
quicksort) and employ some type class magic (like continuations) to
make the reification  transparent to the code.
 I reified reify.
More information about the Haskell-Cafe