new method without recursion

Author: ArthBachhuka123

src/main/java/com/thealgorithms/recursion/FibonacciSeries.java

@@ -18,4 +18,20 @@ public static int fibonacci(int n) {
             return fibonacci(n - 1) + fibonacci(n - 2);
         }
     }
-}
+
+
+// n is the number upto which fibonacci sequence is required 
+// for example n = 4 , output  = 0 1 1 2 
+    public static void fibo(int n){
+        int a = 0 ; int b = 1 ; int c =0;
+        System.out.print(a+" "+b);
+        for (int i = 2 ; i<n ; i++){
+            c = a+b;
+            System.out.print(" "+ c);
+            a = b ;
+            b = c ;
+        }
+
+    }
+
+}