3a30fb8a07
Don't break urls. 1. New Route function which generates routes compatible with old blog. 2. Renamed posts folder to blog.
713 B
713 B
| layout | title | date | comments | categories | |||
|---|---|---|---|---|---|---|---|
| post | Recursion | 2015-08-22 00:28 | true |
|
fibonacci :: [Integer]
fibonacci = 1:1:(zipWith (+) fibonacci (tail fibonacci))
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