Joel Grus • 7/7/2015

Haskell-Style Fibonacci in Python

This article analyzes the classic Fibonacci sequence problem, comparing inefficient recursive and iterative Python solutions. It then introduces a Haskell-style, lazy infinite list implementation in Python using generators and `itertools.tee` to achieve a more elegant and declarative functional programming approach.

0 comments

#Python #memoization #functional programming