[Haskell-cafe] Need for speed: the Burrows-Wheeler Transform

[Bulat Ziganshin]

Hello Andrew,

Saturday, June 23, 2007, 2:45:01 PM, you wrote:

> Hey, I'm just glad I managed to get within striking distance of Mr C++.
> So much for Haskell being "inherently less performant". :-P

my little analysis says that it's probably due to different sort()
implementations, so this says nothing about general case

-- 
Best regards,
 Bulat                            mailto:Bulat.Ziganshin at gmail.com