Fibonacci Series

About the Fibonacci Series :

The Fibonacci series of numbers are found by adding the two numbers before it.

         0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ...

We can compute Fibonacci numbers with recursion. This can be a bit slow. It is also possible to use iteration in computing Fibonacci Series.To compute a Fibonacci number at a certain position N, we have to loop through all previous numbers starting at position 0.

Logic :                                                                                                                                                        

prev	next	sum
	shifted to prev	shifted to next
1	1	2
1	2	3
2	3	5
3	5	8
5	8	13
8	13	...
13	...	...

Applications :

1. Financial Markets
2. Natural Phenomena
3. Music , etc .,

Fibonacci Codes in various programming languages :

• MATLAB Fibonacci Code ( Click Here )
• C++ Fibonacci Code ( Click Here )
• C# Fibonacci Code ( Click Here )
• PYTHON Fibonacci Code ( Click Here )
• JAVA Fibonacci Code ( Click Here )
• JAVASCRIPT Fibonacci Code ( Click Here )
• RUBY Fibonacci Code ( Click Here )
• PHP Fibonacci Code ( Click Here )
• ASSEMBLY LANGUAGE Fibonacci Code ( Click Here )