Fibonacci series in Java
In Fibonacci series, the next number is the sum of the two previous numbers, for example, 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, etc. The first two numbers in the Fibonacci series are 0 and 1.
A Fibonacci Series is a series of numbers in which
every number (except the first two numbers) is the sum of the previous
two numbers. A Fibonacci series usually starts from 0 and 1. In
this article, we will cover the Fibonacci series using recursion in
Java and without using recursion.
There are two ways to write the Fibonacci series program in Java:
- Fibonacci series without using recursion
- Fibonacci series using recursion
Fibonacci Series in Java without using recursion
class Main {
public static void main(String[] args) {
int n = 10, fTerm = 0, sTerm = 1;
System.out.println("Fibonacci Series till " + n + " terms:");
for (int i = 1; i = n; ++i) {
System.out.print(firstTerm + ", ");
// compute the next term
int nTerm = fTerm + sTerm;
fTerm = sTerm;
sTerm = nTerm;
}
}
}
Output:
Fibonacci Series using recursion in java
public class FibonacciCalc {
public static int fibRecursion(int count) {
if (count == 0) {
return 0;
} // Oth fibonacci is 0
if (count == 1 || count == 2) {
return 1;
} // 1st and 2nd Fibonacci are 1 and 1 only
// calling function recursively for nth Fibonacci
return fibRecursion(count - 1) + fibRecursion(count - 2);
}
public static void main(String args[]) {
int fib_len = 9;
System.out.print("Fibonacci Series of " + fib_len + " numbers is: \n");
for (int i = 0; i fib_len; i++) {
System.out.print(fibRecursion(i) + " ");
}
}
}
Output:
That’s all in this post, If your code does not work or you’ve faced any problem then comment down your problem.