Python Calling A Raise Exception Instead Of Returning In Recursive Function
I have to check how much faster works a code where I throw exception to end a recursion instead of return My code with return looks this way: def factorial(self, n): if n==
Solution 1:
you need the try/except in the else part of this function ... since all calls will eventually raise this exception if you listen outside then all your work is lost
def factorial2(self, n):
if n==0:
raise Exc(1)
else:
try:
return n* self.factorial2(n-1)
except Exc:
return n
Post a Comment for "Python Calling A Raise Exception Instead Of Returning In Recursive Function"