Merge pull request #1604 from DevBhojani116/master

Updated Fibonacci.py using recursion

Author: avinashkranjan

Fibonacci_Sequence_Generator/Fibonacci.py

@@ -1,23 +1,17 @@
-def Fibbo_Sequence_Generator():
-    # Generates a fibonacci sequence with the size of ngi
-    runFib = True
-    while(runFib):
-        n = int(input('How many numbers do you need? '))
-        if n > 0 :
-            runFib = False
-            series = [1]
+#function which finds out individual term of the fibonacci sequence
+def fibo(x):
+    if(x == 1 or x == 2): #base case
+        return 1
+    else:
+        return fibo(x-1) + fibo(x-2) 
+        #following the actual way how the fibonacci series is generated i.e. adding the previous two terms
 
-            while len(series) < n:
-                if len(series) == 1:
-                    series.append(1)
-                else:
-                    series.append(series[-1] + series[-2])
+n = 0
+while(n<=0):
+    n = int(input("Enter how many terms do you need in your Fibonacci Sequence? "))
+    #this loop is just to ensure that the user inputs a valid number
 
-            for i in range(len(series)):  # Convert the numbers to strings
-                series[i] = str(series[i])
-        else:
-            print('enter a valid number')
-
-    return(', '.join(series))  # Return the sequence seperated by commas
-
-print(Fibbo_Sequence_Generator())
+for i in range(1,n): 
+    #finding out individual terms of the series and printing till (n-1) terms since we don't want an extra comma at the end
+    print(fibo(i), end=", ")
+print(fibo(n)) #printing the last(i.e. nth term)