> I like the quicksort example at > http://www.haskell.org/haskellwiki/Introduction very much; it shows how much > time you can save when you use Haskell.
Nice idea. Perhaps use a merge sort, because that is actually useful, because it does not degenerate for large lists. Matthias. _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
