On Sat, Apr 19, 2008 at 10:56 AM, Andrew Coppin <[EMAIL PROTECTED]> wrote: > Can anybody explain any of this behaviour? I have no idea what I'm > benchmarking, but it certainly doesn't appear to be the performance of a > parallel merge sort!
It would be much easier to draw sound conclusions if you would post your code. -- Denis _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
