DEV Community

Discussion on: Challenge: Write the recursive Fibonacci algorithm in a different language.

View post

Replies for: I have haskell here with the best form of recursion: Self-recursion! fibs = 1:1:zipWith (+) fibs (tail fibs) fib n = fibs !! n Here fibs is ...

Collapse
 
jvanbruegge profile image
Jan van Brügge •

I also have the boring tail recursive version here:

fib n = fibHelper n 1 1
    where fibHelper  0 a  _ = a
          fibHelper !n a !b = fibHelper (n-1) b (a+b)