Fibonacci series without using recursion in java

1. package com.instaceofjava;
   
   public class Fibanaciwithoutrecursive {
   
   public static void main(String[] args) {
   
   int n1=0;
   
   int n2=1;
   
   System.out.println(n1);
   
   System.out.println(n2);
   
   for(int i=0;i<=100;i++){
   
   int sum=n1+n2;
   
   if(sum<=100){
   
   n1=n2;
   
   n2=sum;
   
   System.out.println(sum);
   
   }
   }
   }

1. Output:
   0
   1
   1
   2
   3
   5
   8
   13
   21
   34
   55
   89