Question

8. Ackermann's Function Ackermann's Function is a recursive mathematical algorithm that can be used to test how well a system optimizes its performance of recursion. Design a function ackermann (m, n), which solves Ackermann's function. Use the following logic in your function: If m 0 then return n + 1 If n = 0 then return ackermann(m – 1, 1) Otherwise, return ackermann(m – 1, ackermann(m, n - 1)) Once you've designed your function, test it by calling it with small values for m and n.

Answer 1

Source Code:

#include <iostream> using namespace std; /*main function*/ int main() { /*function prototype*/ int ackermann(int,int); /*variables*/ int result,m,n; /*read value of m from the user*/ cout<<"Enter the value of m: "; cin>>m; /*read value of n from the user*/ cout<<"Enter the value of n: "; cin>>n; /*function call*/ result=ackermann(m,n); /*print result*/ cout<<"The result is: "<<result; return 0; }

/*function defintion*/ int ackermann(int mint n) { /*if mis 0*/ if(m==0) return n+1; /*if n is a then call function recursively*/ if(n==0) return ackermann(m-1,1); /*otherwise call function recursively*/ else re urn ackermann(m-1, acker nn(m, n-1)); }

Output:

C:\Users\Kumar Reddi\Desktop\trail.exe Enter the value of m: 3 Enter the value of n: 2 The result is: 29 Process exited after 1.52 seconds with return value o Press any key to continue ..

Code in text format (See above images of code for indentation):

#include <iostream>
using namespace std;
/*main function*/
int main()
{  
   /*function prototype*/
   int ackermann(int,int);
   /*variables*/
   int result,m,n;
   /*read value of m from the user*/
   cout<<"Enter the value of m: ";
   cin>>m;
   /*read value of n from the user*/
   cout<<"Enter the value of n: ";
   cin>>n;
   /*function call*/
   result=ackermann(m,n);
   /*print result*/
   cout<<"The result is: "<<result;
   return 0;
}
/*function defintion*/
int ackermann(int m,int n)
{
   /*if m is 0*/
   if(m==0)
       return n+1;
   /*if n is 0 then call function recursively*/
   if(n==0)
       return ackermann(m-1,1);
   /*otherwise call function recursively*/
   else
       return ackermann(m-1,ackermann(m,n-1));
}