实现阿克曼函数并统计递归调用次数

Counting times of recursion calling





1．　　问题描述

定义阿克曼递归函数：

ACK(0,n)=n+1 n>=0

ACK(m,0)=ACK(m-1,1) m>=1

ACK(m,n)=ACK(m-1,ACK(m,n-1)) m,n>0

2．　　基本要求

读入m、n，输出ACK(m,n)的值，并统计递归调用次数。-Ackermann achieve statistical and recursive function call Counting the number of times recur as contemplated by calling 1. Problem descr iption definition of a recursive function Ackerman : ACK (0, n) = n 1 n