Home >>Java Programs >Fibonacci series without using recursion in Java
In this example, we will see a Java program to find the Fibonacci series.
In the Fibonacci series, the next number is the sum of the previous two numbers. For example 0, 1, 1, 2, 3, etc. The first two numbers of the Fibonacci series will be 0 and 1.
In this program, we will find the Fibonacci series without using the recursion in Java.
Program
class Main
{
public static void main(String args[])
{
int n1=0,n2=1,n3,i,count=10;
System.out.print(n1+" "+n2);//printing 0 and 1
for(i=2;i<count;++i)//loop starts from 2 because 0 and 1 are already printed
{
n3=n1+n2;
System.out.print(" "+n3);
n1=n2;
n2=n3;
}
}
}