I currently use this code:
def f():
try:
f()
except RecursionError:
f()
try:
f()
except RecursionError:
f()
This results in a fatal stack overflow instantly. However, I was wondering if there is an easier way to do this which is much more Pythonic.
import sys
sys.setrecursionlimit(10**8)
def ackermann(m,n):
if m == 0:
return (n + 1)
elif n == 0:
return ackermann(m - 1, 1)
else:
return ackermann(m - 1, ackermann(m, n - 1))
for x in range(5):
for y in range(5):
print(ackermann(x, y))
Python's default recursion limit is 10**4. Changable with setrecursionlimit() so you can get a 'Stack overflow' error because Ackermann function's output is too long.
I like to use
def test(n):
if n == 1:
return 1
else:
return test(n-1)*n
to test max recursion. It will throw a 'RecursionError: maximum recursion depth exceeded in comparison' if n is to large.
MemoryError(but only after waiting for your system to go through swap hell for a while, at least in 64-bit), and in Jython you should get a (catchable) Java StackOverflowError rather than a fatal crash.