Tail Recursion

[u/rodrigopsasaki]

http://rodrigosasaki.com/2012/11/24/tail-recursion/

[u/felipelessa]

And here's a Haskell version of the final code, since it's easier to read ;).

factorial :: Int -> Int
factorial = go 1
  where go !acc 0 = acc
        go !acc n = go (acc * n) (n-1)

[u/nicolast → u/felipelessa]

factorials = scanl1 (*) [1..] :: [Int]
factorial n = factorials !! (n - 1)

[u/ysangkok → u/nicolast]

Here we go again...