From ab36ea43257ca76f8917cf534e798c5c4afd227c Mon Sep 17 00:00:00 2001 From: Nikhil Nayak Date: Thu, 3 Oct 2019 20:12:55 +0530 Subject: [PATCH 1/2] Update fibonacci_sequence_recursion.py Fixed Missing return statement. --- maths/fibonacci_sequence_recursion.py | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/maths/fibonacci_sequence_recursion.py b/maths/fibonacci_sequence_recursion.py index 9190e7fc7a40..657e76c6f4b2 100644 --- a/maths/fibonacci_sequence_recursion.py +++ b/maths/fibonacci_sequence_recursion.py @@ -4,7 +4,7 @@ def recur_fibo(n): if n <= 1: return n else: - (recur_fibo(n-1) + recur_fibo(n-2)) + return recur_fibo(n-1) + recur_fibo(n-2) def isPositiveInteger(limit): return limit >= 0 From a5da494676d92e13f273a0a2c684e97138873a98 Mon Sep 17 00:00:00 2001 From: Nikhil Nayak Date: Thu, 3 Oct 2019 21:14:56 +0530 Subject: [PATCH 2/2] Minimized the code a bit. --- maths/fibonacci_sequence_recursion.py | 5 +---- 1 file changed, 1 insertion(+), 4 deletions(-) diff --git a/maths/fibonacci_sequence_recursion.py b/maths/fibonacci_sequence_recursion.py index 657e76c6f4b2..6c2217af4d4d 100644 --- a/maths/fibonacci_sequence_recursion.py +++ b/maths/fibonacci_sequence_recursion.py @@ -1,10 +1,7 @@ # Fibonacci Sequence Using Recursion def recur_fibo(n): - if n <= 1: - return n - else: - return recur_fibo(n-1) + recur_fibo(n-2) + return n if n <= 1 else recur_fibo(n-1) + recur_fibo(n-2) def isPositiveInteger(limit): return limit >= 0