[Haskell-cafe] haskell in online contests

vishnu pathsny at gmail.com
Fri Nov 27 22:59:52 EST 2009

Hi Daniel
   Wow that's fantastic. Could you explain those further optimisations a bit
more please? Especially the whole "more lazyness" thing.

Timings here:
Your last ByteString code: 128s
That with corrected index calculation: 172s
Correct indices and distance orig new = f m n instead of memf m n: 99s
That and an array for the substitution cost: 64s

String IO, substitution cost array and a suitably lazy break-early distance
function: 1.7s
That and a lazier surcharge function: 1.5s
The same with ByteString IO: 1.4s

Yes, I'd say that qualifies as a significant speedup.
Haskell-Cafe mailing list
Haskell-Cafe at haskell.org
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org/pipermail/haskell-cafe/attachments/20091127/0ae45fab/attachment.html

More information about the Haskell-Cafe mailing list