4 ms·

fib 0 = 0 fib 1 = 1 fib n = fib (n-1) + fib (n-2)

• eru 6y ago
  Oh, that version takes exponential time to compute. The one-liner I gave computes up to the n-th Fibonacci number in linear time.
  • exdsq 6y ago
    Your version is definitely more performant, but the three liner is just a bit nicer to read (especially for beginners) :)
    • eru 6y ago
      Yes. It depends on what you want to show. Your version shows how to define functions and some simple pattern matching.
      • exdsq 6y ago
        Having worked with Haskell for a year now I still can't read much more than functions and pattern matching! :D
  • Smaug123 6y ago
    Not in Haskell, it doesn't. Haskell stores everything for you, right?
    • tome 6y ago
      No, it doesn't.