Why Python Recursive Function Sometimes Returns None
Unlike iterative functions, recursive functions rely on their recursive calls to return values. When the function is called multiple times, the return values need to be handled appropriately to obtain the desired output.
Consider the following Python code:
def gcdIter(a, b):
a, b = min(a, b), max(a, b)
if b % a == 0:
print(a)
return a
gcdIter(a, b % a)
This function aims to find the greatest common divisor of two numbers using recursion. However, it may return None for certain inputs because the recursive call's return value is not handled correctly.
print(gcdIter(306, 136)) # Returns None
print(gcdIter(42, 84)) # Returns 42
To resolve this, the code needs to pass the recursive call's return value back to the main function. By modifying the line gcdIter(a, b % a) to return gcdIter(a, b % a), the function will correctly return the greatest common divisor.
def gcdIter(a, b):
a, b = min(a, b), max(a, b)
if b % a == 0:
print(a)
return a
return gcdIter(a, b % a)
Alternatively, the function can be rewritten more compactly as:
def gcd_iter(a, b):
return gcd_iter(b, a % b) if b else abs(a)
Disclaimer: All resources provided are partly from the Internet. If there is any infringement of your copyright or other rights and interests, please explain the detailed reasons and provide proof of copyright or rights and interests and then send it to the email: [email protected] We will handle it for you as soon as possible.
Copyright© 2022 湘ICP备2022001581号-3