There is not now, nor has there ever been, nor will there ever be, any programming language in which it is the least bit difficult to write bad code. Flon's Law

Fibonacci numbers

Language Java | Level Intermediate | Category Algorithms | August 4, 2015 8:51 am


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.

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.

Write a program to print the Fibonacci numbers?

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.