# Recursion

August 22, 2015 , posted in haskell, recursion, fibonacci numbers

Above is a simple function that generates an infinite stream of fibonacci numbers. Its written in haskell.

This is a piece of code that made me think a lot lately, it make clever use of recursion to define the stream and computes with a linear number of additions. I think its pretty damn sexy!

## Notes:

- Many thanks to a co-worker who helped me figure this out.
- I hear that there are more efficient ways to compute fibonacci numbers (namley O(logn)). - should investigate this