Is your proposal related to a problem? Please describe.
Ackermann Function is function with two arguments each of which can be assigned any non-negative integer. It uses recursion to compute the value.
It is calculated using this logic :
if m=0 then Ackermann(m,n)= n+1,
if m>0, n=0 then Ackermann(m,n)= Ackermann(m-1,n) and
if m>0, n>0 then Ackermann(m,n)= Ackermann(m-1,Ackermann(m,n-1))
Add any other context or screenshots about the proposal request here.
I would like to use python and C to create this recursive function.
Is your proposal related to a problem? Please describe.
Ackermann Function is function with two arguments each of which can be assigned any non-negative integer. It uses recursion to compute the value.
It is calculated using this logic : if m=0 then Ackermann(m,n)= n+1, if m>0, n=0 then Ackermann(m,n)= Ackermann(m-1,n) and if m>0, n>0 then Ackermann(m,n)= Ackermann(m-1,Ackermann(m,n-1))
Add any other context or screenshots about the proposal request here.
I would like to use python and C to create this recursive function.