Question

Write programs for the Ackerman function shown below in C and in Scheme (Racket). Functionality and Documentation is critical in these programs. Be sure your code is your own. If you get outside help, you will receive a zero for this exam. When you submit the programs, upload the c code and scheme code in separate files. The Ackermann function is defined recursively for two non-negative integers’ s and t as follows. A(s, t) = {(t+1,@A(s-1,1),@A(s-1,A(s,t-1)),)┤ ■(if s=0@ if s>0 and t=0@ if s>0 and t>0) Follow the methods discussed for writing recursive methods. Implement the function A(s t) in C. The function should take two inter numbers, m and n, and return the value of A(s, t), which is a long integer. Notice that the Ackerman function is a very rapidly growing function. Even values of 4 for m and n will yield an extremely large number, and thus using a long integer as the return value is necessary. Write a main program that takes inputs of m and n from the keyboard; call the recursive function, and then print the results. Repeat the above coding exercise, but in Scheme.

Answer 1

The Code for given program is as follows:

#include <stdio.h>
int A(int,int );
int main()
{
int m,n;
scanf("%d%d",&m,&n);
int p= A(m,n);
printf("%d",p);
return 0;
}
int A(s,t)
{int t1;
if(s==0) { return (t+1);}
if(s>0 && t==0) { return A(s-1,t); }
if(s>0 && t>0) {t1 = A(s,t-1) ; return A(s-1, t1); }
}

Run Debug Stop Share H Save Beautify Language C main.c 1 #include <stdio.h> 2 int A(int,int); 3 int main() 4- 5 int min; 6 scanf("%d%d",&m, &n); int p= A(m,n); 8 printf("%d",p); return 0; 10 } int A(s, t) 12 - {int t1; 13 if(s==0) { return (t+1);} if(s) && t==0) { return A(S-1,t); } if(s>0 && t>) {t1 = A(s, t-1); return A(S-1, t1); } input main.c:11:5: warning: type of 's' defaults to 'int' [-Wimplicit-int] main.c:11:5: warning: type of 't' defaults to 'int' [-Wimplicit-int] ... Program finished with exit code o Press ENTER to exit console.

-> on calling AC), D) ty= AC110) will be called → AC1,0) = AC00 condition of . So, 2 og > AC00) = return (t +)). .. Sreturn : >) t;= À C110) = AC0,0) = 1. ... ACI, 1D = retuon CACD, 1)) = retuon citi = return (2)