I took a quick crack at optimizing fannkuch.hs. I got it down from 33s to
1.25s on my machine, with N=9. That should put it between forth and
ocaml(bytecode) in the shootout page. The main changes I made were using
Int instead of Int8, foldl' to accumulate the max number of folds, a
custom flop function rather than a combination of reverse and splitAt, and
a simpler definition for permutations.
http://kimbly.com/code/fannkuch.hs
Kimberley Burchett
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe