package com.manish.fiboseries;
import java.util.Scanner;
public class FibonacciSeries
{
public static void main(String[] args)
{
int num=new Scanner(System.in).nextInt(); /* inter the number upto
which fibonacci series has to be calculated */
for(int i=1;i<=num;i++) //
{
System.out.print(fibonacciIteration(i)+" ");
}
System.out.println("");
for(int i=1;i<=num;i++)
{
System.out.print(fibonacciRecursion(i)+" ");
}
}
public static int fibonacciIteration(int number)
{
if(number == 1 || number == 2)
{
return 1;
}
int fib1=1, fib2=1, fibonacci=1;
for(int i= 3; i<= number; i++)
{
fibonacci = fib1 + fib2;
fib1 = fib2;
fib2 = fibonacci;
}
return fibonacci;
}
public static int fibonacciRecursion(int number) //recursion method
{
if(number == 1 || number == 2)
{
return 1;
}
return fibonacciRecursion(number-1)+ fibonacciRecursion(number-2);
}
}
No comments:
Post a Comment