Programming help: Ackerman’s function can be defined by the reccurence relation - Help.com

Ackerman’s function can be defined by the reccurence relation

A(m,0)=A(m-1,1), m=1,2,….
A(m,n)=A(m-1,A(m,n-1)) m=1,2….,n=1,2,….
and the initial conditions:
A(0,n)=n+1 n=0,1,…..
What is A(1,2)?
Implement the function in c++ and do a box trace of A(1,2)

Could someone please help me solve this question within 24hrs as it is an assignment and is bound to come in my exam a day after tommorrow.

This open post was written 6 years, 9 months ago | V/U/S: 1,157, 1, 2 | Edit Post | Leave a reply | Report Post


Reciprocity (0) Reciprocation Failure -- The poster has NOT helped anyone else yet!

Since writing this post rasphatik may have helped people, but has not within the last 4 days. rasphatik is a verified member, has been around for 6 years, 9 months and has 1 posts and 0 replies to their name.

Post Tags (3)

C++, Programming, software language (How Tags Affect Reciprocity)

Replies (1)

Where were you?

Click and drag to move the map around. FAQ: How we place people on this map »
You can also watch events on Help.com as they happen
Mouse over the map for 2 seconds to see an expanded, interactive view

jamula_200 offline Unverified User #
An Unknown Location | 4 years ago (2 years, 8 months after post)

can you help in calculatig time and space complexity for ackerman

Quote this reply Report this reply to moderators
This account has been deactivated.

Invite Others to Help

A logged in and verified Help.com member has the ability to setup a Friends List and invite others to help with posts.