Hello Matthias,
Monday, July 13, 2009, 6:05:06 PM, you wrote:
I like the quicksort example at
Nice idea. Perhaps use a merge sort, because that is actually useful,
because it does not degenerate for large lists.
Great idea if we want to keep Haskell community compact :)))
--
Best
Nice idea. Perhaps use a merge sort, because that is actually useful,
because it does not degenerate for large lists.
Great idea if we want to keep Haskell community compact :)))
Or stay with quicksort --- which is treesort. :o)
___
Haskell-Cafe
