Haskell: Fibonacci in O(n) time
1 min readJun 16, 2020
Inspired by: https://www.youtube.com/watch?v=_JtPhF8MshA&t=13m12s
Use https://repl.it/languages/haskell to run the code.\
A mind-blowing version I’ve seen:
fibs = Data.Function.fix $ (0:) . scanl (+) 1
fib = (fibs !!)