Perfection [in design] is achieved, not when there is nothing more to add, but when there is nothing left to take away. Antoine de Saint-Exupéry
Fibonacci numbers
Algorithm Problem Description
Fibonacci number is a number that start with one or zero and next number is equal to the sum of previous two numbers. Ex F (0) = 0, 1, 1, 2, 3, 5, 8, 13, 21, 34
Sample Input and Output
The first two numbers in the Fibonacci sequence are either 1 and 1, or 0 and 1, depending on the chosen starting point of the sequence, and each subsequent number is the sum of the previous two.
Example
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ...
Output
Print the first 10 Fibonacci numbers using iterative funcation:1 1 2 3 5 8 13 21 34 55
Print the first 10 Fibonacci numbers using recursive funcation:1 1 2 3 5 8 13 21 34 55
Comments
Please login to add comments.