[Haskell-cafe] faster factorial function via FFI?
bulat.ziganshin at gmail.com
Wed Apr 25 10:15:58 EDT 2007
Tuesday, April 24, 2007, 3:25:39 AM, you wrote:
> Usings Ints everywhere isn't an option, because my final answers are
> definitely Integers -- although I might try using Ints in some places. I
may be memoizing is the right answer?
factorials :: Array Int Integer
factorials = array (0,100) (map factorial [1..n])
Bulat mailto:Bulat.Ziganshin at gmail.com
More information about the Haskell-Cafe