Fixed non-recursive and added recursive fibonacci series.

Codes/Code-A1.py

@@ -8,10 +8,26 @@ def fibonacci(n):
 
     for i in range(n):
         fib_series.append(a)
-        a = b
+        a, b = b, a + b
-        b = a + b
 
     return fib_series
 
+# Recursion
+def fibonacci_recursive(n):
+    if n <= 0:
+        return []
+    elif n == 1:
+        return [0]
+    elif n == 2:
+        return [0, 1]
+    else:
+        fib_series = fibonacci_recursive(n - 1)  # Get the series up to n-1
+        fib_series.append(fib_series[-1] + fib_series[-2])  # Append the next Fibonacci number
+        return fib_series
+
+# Non-recursion
 n = int(input("Enter total numbers to print in fibonacci series:\t"))
-print(fibonacci(n))
+print("Fibonacci Series (non-recusive):\t", fibonacci(n))
+
+# Recursion
+print("Fibonacci Series (recusive):\t\t", fibonacci_recursive(n))