Fibonacci series in Java
In fibonacci series, next
number is the sum of previous two numbers for example 0, 1, 1, 2, 3,
5, 8, 13, 21, 34, 55 etc. The first two numbers of fibonacci series are 0 and
1.
There are two ways to write the
fibonacci series program in java:
- Fibonacci Series without using recursion
- Fibonacci Series using recursion
package com.java2novice.algos;
public class MyFibonacci {
public static void
main(String a[]){
int
febCount = 15;
int[]
feb = new int[febCount];
feb[0]
= 0;
feb[1]
= 1;
for(int
i=2; i < febCount; i++){
feb[i]
= feb[i-1] + feb[i-2];
}
for(int
i=0; i< febCount; i++){
System.out.print(feb[i]
+ " ");
}
}
}
OR
1. class FibonacciExample1{
2. public static void main(String args[])
3. {
4. int n1=0,n2=1,n3,i,count=10;
5. System.out.print(n1+" "+n2);//printing 0 and 1
6.
7. for(i=2;i<count;++i)//loop starts from 2 because 0 and 1 are already printed
8. {
9. n3=n1+n2;
10. System.out.print(" "+n3);
11. n1=n2;
12. n2=n3;
13. }
14.
15. }}
0 comments:
Post a Comment