We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Functional Programming
  3. Recursion
  4. Fibonacci Numbers
  5. Discussions

Fibonacci Numbers

  • francisco
     + 0 comments

    Easy in Haskell

    fib n = fibs !! (n -1) where
    fibs = 0:1:[(a+b)|(a, b) <- zip fibs (tail fibs)]