请问这道算法题怎么解?
Ackermann's function A(m,n) is defined as follows:
--- n + 1 , if m = 0
|
A(m, n) = -|-- A(m - 1, 1) , if n = 0
|
--- A(m - 1, A(m, n - 1)) , otherwise
This function is studied because it grows very fast for small values of m and n. Write a nonrecursive algorithm for computing Ackermann's function.
Please implement the algorithm by using C/C++, thank you!