From 1de9a68af645d8f4537e4a0acc2bc829edbc681d Mon Sep 17 00:00:00 2001 From: muzammillcoste Date: Wed, 5 Oct 2022 00:24:27 +0500 Subject: [PATCH 1/7] update fibonacci func in fibonacci_series/Python/python_fibonacci_recursion.py --- .../Python/python_fibonacci_recursion.py | 23 +++++++++++-------- 1 file changed, 13 insertions(+), 10 deletions(-) diff --git a/fibonacci_series/Python/python_fibonacci_recursion.py b/fibonacci_series/Python/python_fibonacci_recursion.py index 9abd945..0bd27ea 100644 --- a/fibonacci_series/Python/python_fibonacci_recursion.py +++ b/fibonacci_series/Python/python_fibonacci_recursion.py @@ -1,17 +1,20 @@ # Recursive fibonnaci code # this algorithm uses recursion to find the nth term in a fibonacci series - -def fibonacci(n): - if n <= 0: - print("Wrong Input!") - elif n == 1: +def Fibonacci(n): + '''This function generate fibonacci series''' + # Check if input is less than 0 then it will print incorrect input + if n < 0: + print("Incorrect input") + # Check if n is 0 then it will return 0 + elif n == 0: return 0 - elif n == 2: + # Check if n is 1,2 it will return 1 + elif n == 1 or n == 2: return 1 else: - return fibonacci(n - 1) + fibonacci(n - 2) - + return (Fibonacci(n-1) + Fibonacci(n-2)) -num = int(input("Enter the nth term: ")) -print(fibonacci(num)) +num=int(input('Enter range: ')) +for x in range(num): + print(Fibonacci(x),end=' ') From c5425ff6686fa41f38040af8a084b7f44a4d033a Mon Sep 17 00:00:00 2001 From: muzammillcoste Date: Wed, 5 Oct 2022 00:51:55 +0500 Subject: [PATCH 2/7] update fibonacci_series/Python/python_fibonacci_recursion.py --- fibonacci_series/Python/python_fibonacci_recursion.py | 4 ---- 1 file changed, 4 deletions(-) diff --git a/fibonacci_series/Python/python_fibonacci_recursion.py b/fibonacci_series/Python/python_fibonacci_recursion.py index 0bd27ea..1595c39 100644 --- a/fibonacci_series/Python/python_fibonacci_recursion.py +++ b/fibonacci_series/Python/python_fibonacci_recursion.py @@ -1,6 +1,3 @@ -# Recursive fibonnaci code -# this algorithm uses recursion to find the nth term in a fibonacci series - def Fibonacci(n): '''This function generate fibonacci series''' # Check if input is less than 0 then it will print incorrect input @@ -14,7 +11,6 @@ def Fibonacci(n): return 1 else: return (Fibonacci(n-1) + Fibonacci(n-2)) - num=int(input('Enter range: ')) for x in range(num): print(Fibonacci(x),end=' ') From 647f89c12c255a6476b702534208907ce83eaea9 Mon Sep 17 00:00:00 2001 From: muzammillcoste Date: Wed, 5 Oct 2022 00:58:46 +0500 Subject: [PATCH 3/7] update fibonacci_series/Python/python_fibonacci_recursion.py --- fibonacci_series/Python/python_fibonacci_recursion.py | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) diff --git a/fibonacci_series/Python/python_fibonacci_recursion.py b/fibonacci_series/Python/python_fibonacci_recursion.py index 1595c39..cda2756 100644 --- a/fibonacci_series/Python/python_fibonacci_recursion.py +++ b/fibonacci_series/Python/python_fibonacci_recursion.py @@ -11,6 +11,5 @@ def Fibonacci(n): return 1 else: return (Fibonacci(n-1) + Fibonacci(n-2)) -num=int(input('Enter range: ')) -for x in range(num): +for x in range(10): print(Fibonacci(x),end=' ') From aeca744569a9f4ee9b212a864c98b52248b85135 Mon Sep 17 00:00:00 2001 From: muzammillcoste Date: Wed, 5 Oct 2022 01:04:10 +0500 Subject: [PATCH 4/7] update fibonacci_series/Python/python_fibonacci_recursion.py --- fibonacci_series/Python/python_fibonacci_recursion.py | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) diff --git a/fibonacci_series/Python/python_fibonacci_recursion.py b/fibonacci_series/Python/python_fibonacci_recursion.py index cda2756..7f171c3 100644 --- a/fibonacci_series/Python/python_fibonacci_recursion.py +++ b/fibonacci_series/Python/python_fibonacci_recursion.py @@ -11,5 +11,4 @@ def Fibonacci(n): return 1 else: return (Fibonacci(n-1) + Fibonacci(n-2)) -for x in range(10): - print(Fibonacci(x),end=' ') +print(Fibonacci(x),end=' ') From 5b985703dd77123a55eab596953134befbbb1919 Mon Sep 17 00:00:00 2001 From: muzammillcoste Date: Wed, 5 Oct 2022 01:09:05 +0500 Subject: [PATCH 5/7] update fibonacci_series/Python/python_fibonacci_recursion.py --- fibonacci_series/Python/python_fibonacci_recursion.py | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/fibonacci_series/Python/python_fibonacci_recursion.py b/fibonacci_series/Python/python_fibonacci_recursion.py index 7f171c3..f06ab8d 100644 --- a/fibonacci_series/Python/python_fibonacci_recursion.py +++ b/fibonacci_series/Python/python_fibonacci_recursion.py @@ -11,4 +11,4 @@ def Fibonacci(n): return 1 else: return (Fibonacci(n-1) + Fibonacci(n-2)) -print(Fibonacci(x),end=' ') +print(Fibonacci(10),end=' ') From 402710290c6f1e4a26c18b3ec1a5e6b65beabc86 Mon Sep 17 00:00:00 2001 From: muzammillcoste Date: Wed, 5 Oct 2022 01:12:29 +0500 Subject: [PATCH 6/7] update fibonacci_series/Python/python_fibonacci_recursion.py --- fibonacci_series/Python/python_fibonacci_recursion.py | 2 ++ 1 file changed, 2 insertions(+) diff --git a/fibonacci_series/Python/python_fibonacci_recursion.py b/fibonacci_series/Python/python_fibonacci_recursion.py index f06ab8d..846b865 100644 --- a/fibonacci_series/Python/python_fibonacci_recursion.py +++ b/fibonacci_series/Python/python_fibonacci_recursion.py @@ -11,4 +11,6 @@ def Fibonacci(n): return 1 else: return (Fibonacci(n-1) + Fibonacci(n-2)) + + print(Fibonacci(10),end=' ') From 93f16ec6bc9fd89b8d0790d330f70dabd0f51fc2 Mon Sep 17 00:00:00 2001 From: muzammillcoste Date: Wed, 5 Oct 2022 10:47:22 +0500 Subject: [PATCH 7/7] update fibonacci_series/Python/python_fibonacci_recursion.py --- fibonacci_series/Python/python_fibonacci_recursion.py | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) diff --git a/fibonacci_series/Python/python_fibonacci_recursion.py b/fibonacci_series/Python/python_fibonacci_recursion.py index 846b865..538a649 100644 --- a/fibonacci_series/Python/python_fibonacci_recursion.py +++ b/fibonacci_series/Python/python_fibonacci_recursion.py @@ -11,6 +11,5 @@ def Fibonacci(n): return 1 else: return (Fibonacci(n-1) + Fibonacci(n-2)) - - + print(Fibonacci(10),end=' ')