Hello guys,

There are various methods to solve Fibonacci sequence problems. But I was not able to find any place where all methods to find Fibonacci were discussed with both proper mathematical explanation and implementation. Therefore, I have written an article for Fibonacci Sequence on my blog which covers all mathematical concepts and implementations and is suitable for **beginners**.

Topics covered are:-

- Brute Force approach ( O(2^n) )
- Dynamic Programming approach ( O(n) )
- Matrix exponential approach ( O(logn) )
- Golden number ratio (well explained) ( O(logn) )
- Analysis of growth of Fibonacci Sequence

Here is the link : Fibonacci Sequence

I hope you find this article insightful

Thank you and happy coding

There are more approach, like topdown-DP + DnC <O(log n) time — O(n) space)>

Please write the full form of DnC. I didn't get you. I haven't written about fast doubling method yet. I will soon update the article.

DnC = divide and conquer

@SPyofgame I have written about DP (Bottom Up implementation) which takes O(n) time and space. Please tell me which DP approach are you talking about which takes O(logn) time and O(n) space.

Topdown-DP approachThis is known as fast doubling method. Please be more specific. Terms like Topdown-DP and DnC are applicable to multiple solutions. In fact every solution of fibonacci is DnC based. Anyway thanks for the reminder