![\"\left\{\begin{matrix}A(0, n) = n + 1,](\"https:\/\/assignmentshark.com\/blog\/wp-content\/ql-cache\/quicklatex.com-4e98c286a9c9f290f61b6fc1fc3d568e_l3.png\" "\\"Rendered")
<\/p>\nTask:<\/p>\n
Find the function of the Ackerman fuction A(m, n), using the recurrence relations:<\/p>\n
<\/p>\n
Find the recursion depth.<\/p>\n
Block-scheme of the solution:<\/p>\n
C++ implementation:<\/p>\n [code language=”cpp”] int Ackerman(int m, int n)\/\/Ackerman function \tif (n >= 0 && m >= 0)\/\/n & m must be >= 0 [\/code]<\/p>\n Screenshots:<\/p>\n Let\u2019s use the table of values of Ackerman function from the Wikipedia to ensure that the program works properly:<\/p>\n This sample is not the single. You have the ability to get acquainted with more sample assignments that concern various disciplines on AssignmentShark. Our homework help service was founded to be helpful for students. Therefore, we try to post useful materials that can help students with their studying. You can look through our articles with tips and recommendations and our sample assignments any time you are in need. If it is not enough, you can also apply for assignment help to our experts. They will help you to complete your assignments quickly and correctly. Each of them is an experienced expert in the specific field. Our service is absolutely safe. There\u2019s no need to worry about your confidentiality. Try our service right now and get your web assignment sample<\/a> completed by one of our experts! We are available 24\/7!<\/em><\/p>\n![\"sample-recursive-functions-1\"](\"https:\/\/assignmentshark.com\/blog\/wp-content\/uploads\/2016\/10\/Sample-Recursive-functions-1.png\")
<\/a><\/p>\n
\n#include<iostream>
\nusing namespace std;
\nint depth;<\/p>\n
\n{
\n\tdepth++;\/\/calculate the recursion depth
\n\tif (m == 0) return n + 1;\/\/end of the recursion
\n\telse
\n\t{
\n\t\tif (n == 0) return Ackerman(m – 1, 1);\/\/recursy
\n\t\telse return Ackerman(m – 1, Ackerman(m, n – 1));
\n\t}
\n}
\nvoid main()
\n{
\n\tint m, n, result;
\n\tcout << "Input m > 0, n > 0:" << endl;
\n\tcin >> m >> n;\/\/input m & n<\/p>\n
\n\t{
\n\t\tresult = Ackerman(m, n);\/\/calculate solution, call Accerman function
\n\t\tcout << "Ackerman(" << m << "," << n << ")=" << result << endl << "recursion depth = " << depth << endl;\/\/output m, n, solution, recursion depth
\n\t}
\n\telse cout << "m or n < 0" << endl;\/\/if m & n < 0
\n\tsystem("pause");\/\/pause console
\n}<\/p>\n<\/a><\/p>\n<\/a><\/p>\n<\/a><\/p>\n<\/a><\/p>\n