Comments on: Efficiently computing a factorial using binary splitting http://www.serpentine.com/blog/2007/04/23/efficiently-computing-a-factorial-using-binary-splitting/ Bryan O'Sullivan's blog Wed, 08 Feb 2012 06:41:38 +0000 hourly 1 http://wordpress.org/?v=3.3.1 By: Bryan O'Sullivan http://www.serpentine.com/blog/2007/04/23/efficiently-computing-a-factorial-using-binary-splitting/comment-page-1/#comment-56871 Bryan O'Sullivan Fri, 22 Jun 2007 06:10:16 +0000 http://www.serpentine.com/blog/2007/04/23/efficiently-computing-a-factorial-using-binary-splitting/#comment-56871 The case statement is pattern matching. It just happens that it's doing so on integer patterns. Trying to hoist the pattern match up to the function definition level would make the code longer, weirder, or both. Try it and see. The case statement is pattern matching. It just happens that it’s doing so on integer patterns. Trying to hoist the pattern match up to the function definition level would make the code longer, weirder, or both. Try it and see.

]]> By: paul http://www.serpentine.com/blog/2007/04/23/efficiently-computing-a-factorial-using-binary-splitting/comment-page-1/#comment-56869 paul Fri, 22 Jun 2007 06:00:58 +0000 http://www.serpentine.com/blog/2007/04/23/efficiently-computing-a-factorial-using-binary-splitting/#comment-56869 I'm looking forward to your Haskell book so I'm cringing at that case statement! Wouldn't pattern matching be more Haskellish? I’m looking forward to your Haskell book so I’m cringing at that case statement! Wouldn’t pattern matching be more Haskellish?

]]> By: Bryan O'Sullivan http://www.serpentine.com/blog/2007/04/23/efficiently-computing-a-factorial-using-binary-splitting/comment-page-1/#comment-54407 Bryan O'Sullivan Fri, 08 Jun 2007 22:00:45 +0000 http://www.serpentine.com/blog/2007/04/23/efficiently-computing-a-factorial-using-binary-splitting/#comment-54407 Yes, a fast multiply is required, but that's common nowadays. Yes, a fast multiply is required, but that’s common nowadays.

]]> By: Matt Doar http://www.serpentine.com/blog/2007/04/23/efficiently-computing-a-factorial-using-binary-splitting/comment-page-1/#comment-43694 Matt Doar Fri, 04 May 2007 21:36:48 +0000 http://www.serpentine.com/blog/2007/04/23/efficiently-computing-a-factorial-using-binary-splitting/#comment-43694 Nice code. Looking at the reference though, isn't the performance improvement dependent upon using FFT or such like for the multiplication operation? ~Matt Nice code. Looking at the reference though, isn’t the performance improvement dependent upon using FFT or such like for the multiplication operation?

~Matt

]]>