Re: [Haskell-cafe] Fast sorting with Bytestring

On Wed, Jun 18, 2008 at 08:56:43PM +0200, Ketil Malde wrote:

Stefan O'Rear writes:

...

GNU 'sort' uses an external sort algorithm. You can, with 200M of memory, give it a 50G input file, and it will work. This might explain the difference..

GNU sort also handles locale-based comparison, which I suspect explains more of the difference. Try with LC_ALL=C.

Well, for input 'bible' with locale en_US.utf8 GNU sort is ~ 6 times slower than with locale C. But for input 'brackets' it is ~ 433 times slower ... Best regards Georg Sauthoff -- Fortune : 'Real programmers don't comment their code. It was hard to write, it should be hard to understand.' ;)