1.定义
ack(m,n) = n+1 m = 0
ack(m,n) = ack(m-1,1) m!=0 n = 0
ack(m,n) = ack(m-1,ack(m,n-1)) m!=0 n!=0
2.Python实现方法
def ack(m,n):
... if m == 0:
... recurse 1= n + 1
... return recurse1
... elif m > 0 and n == 0:
... recurse2 = ack(m - 1,1)
... return recurse2
... elif m > 0 and n > 0:
... recurse3 = ack(m - 1,ack(m,n - 1))
... return recurse3
...
如何改进该算法?请各位大牛指点!