ackermann-nonrecursive.cpp

Ackermann-nonrecursive.cpp, 艾克曼, 非递回

#include <stdio.h>
#include <stdlib.h>
#include <stack>

using namespace std;

int ackermann(int m , int n)
{
	stack<int>s;
	s.push (m);
	while (! s.empty ())
	{
		m = s.top ();
		s.pop ();
		if (m == 0)
		n = n + 1;
		else {
			s.push (m - 1);
			if (n == 0)
				n = 1;
			else {
				s.push (m);
				n = n - 1;
			}
		}
	}
	return n;
}

int main(void)
{
   int m,n;//