I have haskell here with the best form of recursion: Self-recursion!
fibs = 1:1:zipWith (+) fibs (tail fibs) fib n = fibs !! n
Here fibs is an infinite List of all fibonacci numbers, the !! function returns the nth element of the list.
fibs
!!
I also have the boring tail recursive version here:
fib n = fibHelper n 1 1 where fibHelper 0 a _ = a fibHelper !n a !b = fibHelper (n-1) b (a+b)
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
I have haskell here with the best form of recursion: Self-recursion!
Here
fibs
is an infinite List of all fibonacci numbers, the!!
function returns the nth element of the list.I also have the boring tail recursive version here: