Read Time:22 Second
Fibonacci Series in Java without using recursion.
Let’s see the Fibonacci series program in java without recursion:

class Program{ public static void main(String args[]) { int n1=0,n2=1,n3,i,count=10; //printing 0 and 1 System.out.print(n1+" "+n2); //loop starts from 2 because 0 and 1 are already printed for(i=2;i<count;++i) { n3=n1+n2; System.out.print(" "+n3); n1=n2; n2=n3; } }}
Average Rating