ackfunction.cpp

实现阿克曼函数并统计递归调用次数 Counting times of recursion calling 1． 问题描述 定义阿克曼递归函数： ACK(0,n)=n+1 n>=0

// ACKFunction.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"


// ACKfunction.cpp : 定义控制台应用程序的入口点。
//

#include "stdafx.h"
#include <iostream>
using namespace std;

unsigned int  count;



long int ACK(unsigned int  m,unsigned int n)
{	
	int p;
	if(m==0)
	{
		count++;
		return n+1;
	}
	else	if(n==0)
		{	
			count++;
		
			return ACK(m-1,1);
		}
			else
			{
			count++;
			p=ACK(m,n-1);
			return ACK(m-1,p) ;
			}			
	
	
}

void main()
{	
	unsigned int  m;
	unsigned int  n;
	unsigned int  x;
	count=0;
	
	cout<<"input m:";
	cin>>m;
	cout<<"input n:";
	cin>>n;
	x=ACK(m,n);
	cout<<"the result is:"<<x<<endl;
	cout<<"count="<<count<<endl;

}